Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002294
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002294 Binomial(5n,n)/(4n+1).
(Formerly M3977 N1646)
+0
16
1, 1, 5, 35, 285, 2530, 23751, 231880, 2330445, 23950355, 250543370, 2658968130, 28558343775, 309831575760, 3390416787880, 37377257159280, 414741863546285, 4628362722856425, 51912988256282175, 584909606696793885 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n), n>=1, enumerates quintic trees (rooted, ordered, incomplete) with n vertices (including the root).

Pfaff-Fuss-Catalan sequence C^{m}_n for m=5. See the Graham et al. reference, p. 347. eq. 7.66. See also the P\'olya-Szeg\"o reference.

Also 5-Raney sequence. See the Graham et al. reference, p. 346-7.

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.

L. Takacs, Enumeration of rooted trees and forests, Math. Scientist 18 (1993), 1-10, esp. Eq. (5).

Editor's note: "Ueber die Bestimmung der Anzahl der verschiedenen Arten, auf welche sich ein n-Eck durch Diagonalen in lauter m-Ecke zerlegen laesst, mit Bezug auf einige Abhandlungen der Herren Lame, Rodrigues, Binet, Catalan und Duhamel in dem Journal de Mathematiques pure et appliquees, publie par Joseph Liouville. T. III. IV.", Archiv der Mathematik u. Physik, 1 (1841), pp. 193ff; see especially p. 198.

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, pp. 200, 347.

G. P\'olya and G. Szeg\"o, Problems and Theorems in Analysis, Springer-Verlag, Heidelberg, New York, 2 vols., 1972, Vol. 1, problem 211, p. 146 with solution on p. 348.

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

Joerg Arndt, Fxtbook

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 287

FORMULA

O.g.f. A(x)= 1 + x*A(x)^5 = 1/(1-x*A(x)^4).

a(n)=binomial(5*n,n-1)/n, n>=1, a(0)=1. From the Lagrange series of the o.g.f. A(x) with its above given implicit equation.

EXAMPLE

There are a(2)=5 quintic trees (vertex degree <=5 and 5 possible branchings) with 2 vertices (one of them the root). Adding one more branch (one more vertex) to these five trees yields 5*5+binomial(5,2)=35=a(3) such trees.

MATHEMATICA

CoefficientList[InverseSeries[ Series[ y - y^5, {y, 0, 100}], x], x][[Range[2, 100, 4]]]

CROSSREFS

Cf. A002295, A002296, A001764, A002293.

Fourth column of triangle A062993.

Sequence in context: A087630 A084135 A138233 this_sequence A051406 A000356 A027392

Adjacent sequences: A002291 A002292 A002293 this_sequence A002295 A002296 A002297

KEYWORD

easy,nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Olivier Gerard (olivier.gerard(AT)gmail.com), Jul 05 2001

Pfaff-Fuss-Catalan, Raney and quintic tree comments from W. Lang, Sep 14 2007.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research