login
The OEIS is supported by the many generous donors to the OEIS 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A355909 Number of nodes at level n in the tree T_0 mentioned in A355905. 2
1, 2, 3, 4, 6, 9, 13, 19, 28, 42, 63, 94, 141, 212, 318, 477, 716, 1074, 1611, 2417, 3626, 5439, 8158, 12237 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
First differences give A355910.
LINKS
Don Knuth, Ambidextrous Numbers, Preprint, September 2022. See (8.1), w_n.
FORMULA
a(n) = 1 + (c(n)+c(n-1))/2 where c(n) = |A355908(n)|.
CROSSREFS
Sequence in context: A121653 A238434 A061418 * A136423 A215245 A078932
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Sep 19 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 December 7 01:11 EST 2023. Contains 367616 sequences. (Running on oeis4.)