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!)
A291442 Matula-Goebel numbers of leaf-balanced trees. 13
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 27, 29, 30, 31, 32, 33, 36, 37, 40, 41, 44, 45, 47, 48, 49, 50, 53, 54, 55, 59, 60, 61, 62, 64, 66, 67, 71, 72, 75, 79, 80, 81, 83, 88, 89, 90, 91, 93, 96, 97, 99, 100, 103, 108 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
An unlabeled rooted tree is leaf-balanced if every branch has the same number of leaves and every non-leaf rooted subtree is also leaf-balanced.
LINKS
MATHEMATICA
nn=2000;
primeMS[n_]:=If[n===1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
leafcount[n_]:=If[n===1, 1, With[{m=primeMS[n]}, If[Length[m]===1, leafcount[First[m]], Total[leafcount/@m]]]];
balQ[n_]:=Or[n===1, With[{m=primeMS[n]}, And[SameQ@@leafcount/@m, And@@balQ/@m]]];
Select[Range[nn], balQ]
CROSSREFS
Sequence in context: A026495 A004437 A298534 * A236866 A122526 A120401
KEYWORD
nonn
AUTHOR
Gus Wiseman, Aug 23 2017
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 April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)