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

 

Logo


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). 4
1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 7, 7, 7, 8, 9, 9, 9, 9, 10, 11, 12, 12, 13, 13, 13, 13, 14, 15, 16, 16, 17, 17, 17, 17, 17, 18, 19, 20, 20, 21, 21, 22, 22, 22, 23, 24, 24, 24, 24, 24, 25, 26, 27, 27, 28, 28, 29, 29, 29, 30, 31, 31, 31, 31, 31, 31, 32, 33, 34, 34 (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

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Nathan Fox, Trees, Fibonacci Numbers, and Nested Recurrences, Rutgers University Experimental Math Seminar, Mar 07, 2019

Rémy Sigrist, PARI program for A324475

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 (This formula assumes that a(0) = 0. - Rémy Sigrist, Mar 14 2021)

PROG

(PARI) See Links section.

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

AUTHOR

Nathan Fox and N. J. A. Sloane, Mar 09 2019

EXTENSIONS

Data corrected and more terms from Rémy Sigrist, Mar 14 2021

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 July 30 04:51 EDT 2021. Contains 346348 sequences. (Running on oeis4.)