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 A324473 #11 Mar 09 2019 14:27:14 %S A324473 1,2,2,3,4,4,4,5,6,6,7,7,7,7,8,9,9,10,11,11,11,1,13,13,13,13,14,15,15, %T A324473 16,17,17,17,18,189,19,20,20,20,20,21,22,22,23,24,24,24,24,24,24,25, %U A324473 26,26,27,28,28,28,29,30,30 %N A324473 k appears A278045(k)+1 times. %C A324473 Each k appears one more times than the number of trailing zeros in the tribonacci representation of n (see A278038). %C A324473 This is related to the tribonacci representation of n in the same way as A046699 (without its initial term) is related to the binary representation of n and as A316628 is to the Zeckendorf representation of n. %H A324473 Nathan Fox, <a href="https://vimeo.com/322291024">Trees, Fibonacci Numbers, and Nested Recurrences</a>, Rutgers University Experimental Math Seminar, Mar 07, 2019 %Y A324473 Cf. A046699, A278038, A278045, A316628. %K A324473 nonn %O A324473 1,2 %A A324473 _N. J. A. Sloane_, Mar 07 2019