Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003238
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003238 Number of rooted trees where at each node all sub-rooted trees are identical.
(Formerly M0628)
+0
17
1, 1, 2, 3, 5, 6, 10, 11, 16, 19, 26, 27, 40, 41, 53, 61, 77, 78, 104, 105, 134, 147, 175, 176, 227, 233, 275, 294, 350, 351, 438, 439, 516, 545, 624, 640, 774, 775, 881, 924, 1069, 1070, 1265, 1266, 1444, 1521, 1698, 1699 (list; graph; listen)
OFFSET

1,3

COMMENT

Comment from Christian Bower: also, number of sequences of positive integers a_1,a_2,...,a_k such that 1+a_1*(1+a_2*(...(1+a_k)...))=n. If you take mu(a_1)*mu(a_2)*...*mu(a_k) for each sequence you get 1's 0's and -1's. Add them up and you get the terms for A007554.

Note that this applies also to planar rooted trees and other similar objects (mountain ranges, parenthesizations) encoded by A014486 - Antti Karttunen Sep 07 2000

Equals sum of (n-1)-th row terms of triangle A152434 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 04 2008]

Equals the eigensequence of A051731, the inverse binomial transform. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 26 2008]

REFERENCES

G. Gati, F. Harary and R. W. Robinson, Line colored trees with extendable automorphisms, Acta Math. Scientia, 2 (1982), 105-110.

F. Harary and R. W. Robinson, The number of achiral trees, J. Reine Angew. Math., 278 (1975), 322-335.

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

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

Shifts one place left under inverse Moebius transform: a(n+1)= Sum a(k), k|n.

Conjecture : log(a(n)) is asymptotic to c*log(n)^2 where 0.4<c<0.5 - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 13 2004

For n>1, a(n) = 1/2 * A068336(n) and sum(k=1, n, a(k)) = A003318(n). - R. Stephan, Mar 27 2004

CROSSREFS

Cf. A007439, A007554, A057546.

Row sums of A122934 (offset by 1).

A152434 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 04 2008]

A051731 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 26 2008]

Sequence in context: A074243 A072720 A018396 this_sequence A051839 A130714 A130689

Adjacent sequences: A003235 A003236 A003237 this_sequence A003239 A003240 A003241

KEYWORD

nonn,nice,eigen

AUTHOR

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

EXTENSIONS

Description improved by Christian G. Bower (bowerc(AT)usa.net), Oct 15 1998.

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research