login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A358730 Positions of first appearances in A358729 (number of nodes minus node-height). 5
1, 4, 8, 16, 27, 54, 81, 162, 243, 486, 729, 1458, 2187, 4374, 6561, 13122, 19683, 39366, 59049 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
First differs from A334198 in having 13122 instead of 12005.
Node-height is the number of nodes in the longest path from root to leaf.
After initial terms, this appears to become A038754.
LINKS
EXAMPLE
The terms together with their corresponding rooted trees begin:
1: o
4: (oo)
8: (ooo)
16: (oooo)
27: ((o)(o)(o))
54: (o(o)(o)(o))
81: ((o)(o)(o)(o))
162: (o(o)(o)(o)(o))
243: ((o)(o)(o)(o)(o))
486: (o(o)(o)(o)(o)(o))
729: ((o)(o)(o)(o)(o)(o))
MATHEMATICA
MGTree[n_]:=If[n==1, {}, MGTree/@Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
rd=Table[Count[MGTree[n], _, {0, Infinity}]-(Depth[MGTree[n]]-1), {n, 10000}];
Table[Position[rd, k][[1, 1]], {k, Union[rd]}]
CROSSREFS
Positions of first appearances in A358729.
A000081 counts rooted trees, ordered A000108.
A034781 counts rooted trees by nodes and height.
A055277 counts rooted trees by nodes and leaves.
MG differences: A358580, A358724, A358726, A358729.
Sequence in context: A008371 A368985 A334198 * A303544 A273029 A273080
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Dec 01 2022
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 07:11 EDT 2024. Contains 375409 sequences. (Running on oeis4.)