This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A324475 #14 Mar 14 2021 20:45:05 %S A324475 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, %T A324475 16,17,17,17,17,17,18,19,20,20,21,21,22,22,22,23,24,24,24,24,24,25,26, %U A324475 27,27,28,28,29,29,29,30,31,31,31,31,31,31,32,33,34,34 %N A324475 k appears t+1 times, where t is the number of trailing zeros in A324474(k). %C A324475 Interesting because the recurrence is nested one layer deeper than the recurrences for A046699 and A316628. %H A324475 Rémy Sigrist, <a href="/A324475/b324475.txt">Table of n, a(n) for n = 1..10000</a> %H A324475 Nathan Fox, <a href="https://vimeo.com/322291024">Trees, Fibonacci Numbers, and Nested Recurrences</a>, Rutgers University Experimental Math Seminar, Mar 07, 2019 %H A324475 Rémy Sigrist, <a href="/A324475/a324475.gp.txt">PARI program for A324475</a> %F A324475 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) %o A324475 (PARI) See Links section. %Y A324475 Cf. A324474. %Y A324475 A046699, A316628, A324473, A324477 have similar definitions. %K A324475 nonn,base %O A324475 1,2 %A A324475 _Nathan Fox_ and _N. J. A. Sloane_, Mar 09 2019 %E A324475 Data corrected and more terms from _Rémy Sigrist_, Mar 14 2021