The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A278678 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A278678

Popularity of left children in treeshelves avoiding pattern T321.
(history; published version)

#29 by Michel Marcus at Mon Mar 23 06:46:26 EDT 2020

STATUS

reviewed

approved

#28 by Joerg Arndt at Mon Mar 23 06:32:01 EDT 2020

STATUS

proposed

reviewed

#27 by Michel Marcus at Mon Mar 23 03:43:30 EDT 2020

STATUS

editing

proposed

#26 by Michel Marcus at Mon Mar 23 03:43:19 EDT 2020

LINKS

J. Françon, <a href="http://www.numdam.org/item/?id=ITA_1976__10_3_35_0">Arbres binaires de recherche : propriétés combinatoires et applications</a>, Revue française d'automatique informatique recherche opérationnelle, Informatique théorique, 10 no. 3 (1976), pp. 35-50

STATUS

proposed

editing

#25 by F. Chapoton at Mon Mar 23 03:19:22 EDT 2020

STATUS

editing

proposed

#24 by F. Chapoton at Mon Mar 23 03:19:08 EDT 2020

PROG

2## by Taylor expansion

## and remove first coefficient 1 that corresponds to O(n**k)

print ([coeffs[n]*factorial(n+2) for n in range(len(coeffs))])

STATUS

approved

editing

Discussion

Mon Mar 23

03:19

F. Chapoton: no space after print in python code

#23 by Bruno Berselli at Mon Nov 06 02:39:44 EST 2017

STATUS

reviewed

approved

#22 by Michel Marcus at Mon Nov 06 02:07:34 EST 2017

STATUS

proposed

reviewed

#21 by Jean-François Alcover at Mon Nov 06 02:05:23 EST 2017

STATUS

editing

proposed

#20 by Jean-François Alcover at Mon Nov 06 02:05:17 EST 2017

MATHEMATICA

b[u_, o_] := b[u, o] = If[u+o == 0, 1, Sum[b[o-1+j, u-j], {j, 1, u}]];

a[n_] := (n+1)*b[n+1, 0] - b[n+2, 0];

Table[a[n], {n, 2, 25}] (* Jean-François Alcover, Nov 06 2017, after Alois P. Heinz *)

STATUS

approved

editing