This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A179438 Number of rooted trees which can be associated with each unrestricted partition. 1
 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 1, 9, 4, 2, 2, 1, 1, 1, 20, 9, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Values can be calculated using simple multiplication when all the parts of a partition are unequal; however when two or more parts are equal avoid over counting by adjusting as illustrated in the example. REFERENCES N. L. Biggs, E. K. Lloyd and R. J. Wilson, Graph Theory 1736-1936, Clarendon Press, 1976, pages 40-43. LINKS EXAMPLE Row six of the table begins: 20 9 4 3 ... because the partitions begin: 6 5+1 4+2 3+3 ... and A000081 begins 1,1,2,4,9,20,... the partition 3+3 has two equal terms so we write 2*(2+1)/2! = 3. Likewise, 3+3+3 has three equal terms so the expression becomes 2*(2+1)*(2+2)/3! CROSSREFS Cf. A000041 (shape sequence) A000081 (row sums) A144963 (a related triangle) Sequence in context: A187800 A323873 A099020 * A211970 A089688 A229706 Adjacent sequences:  A179435 A179436 A179437 * A179439 A179440 A179441 KEYWORD nonn,tabf,uned AUTHOR Alford Arnold, Jul 14 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 22 18:53 EDT 2019. Contains 323481 sequences. (Running on oeis4.)