OFFSET
1,2
COMMENTS
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
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