login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054657 Number of leaves on the rooted tree of height n constructed by the following rule. Assign weight 1 to the single node at height 1. At each node of weight w at height k>0, branch to nodes at height k+1 as follows: one node of weight 1 and a node of weight d+1 if d divides w. 0
1, 2, 5, 13, 35, 94, 255, 691, 1876, 5092, 13829 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

If the condition "d divides w" in the definition is replaced by "d<=w" then sequence A000108 (the Catalan numbers) is obtained.

LINKS

Table of n, a(n) for n=1..11.

CROSSREFS

Sequence in context: A160438 A335725 A240609 * A024576 A057960 A339479

Adjacent sequences:  A054654 A054655 A054656 * A054658 A054659 A054660

KEYWORD

nonn

AUTHOR

John W. Layman, Apr 17 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 13:03 EST 2021. Contains 349526 sequences. (Running on oeis4.)