This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324475 k appears t+1 times, where t is the number of trailing zeros in A324474(k). 3
 1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 7, 7, 7, 8, 9, 9, 9, 9, 10, 11, 12, 12, 13, 14, 15, 16, 16, 17, 17, 17, 17, 17, 18, 19, 20, 20, 21, 21, 22, 22, 22 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Interesting because the recurrence is nested one layer deeper than the recurrences for A046699 and A316628. LINKS Nathan Fox, Trees, Fibonacci Numbers, and Nested Recurrences, Rutgers University Experimental Math Seminar, Mar 07, 2019 FORMULA For n>3, a(n) = a(n-a(n-1)) + a(n-1-a(n-2)-a(n-2-a(n-2))) + a(n-2-a(n-3)-a(n-3-a(n-3)) - a(n-3-a(n-3)-a(n-3-a(n-3)))). - Nathan Fox, Mar 09 2019 CROSSREFS Cf. A324474. A046699, A316628, A324473, A324477 have similar definitions. Sequence in context: A134995 A194243 A279402 * A189705 A303601 A031247 Adjacent sequences:  A324472 A324473 A324474 * A324476 A324477 A324478 KEYWORD nonn,base,more AUTHOR Nathan Fox and N. J. A. Sloane, Mar 09 2019 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.

Last modified December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)