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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324473 k appears A278045(k)+1 times. 3

%I

%S 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 16,17,17,17,18,189,19,20,20,20,20,21,22,22,23,24,24,24,24,24,24,25,

%U 26,26,27,28,28,28,29,30,30

%N k appears A278045(k)+1 times.

%C Each k appears one more times than the number of trailing zeros in the tribonacci representation of n (see A278038).

%C 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 Nathan Fox, <a href="https://vimeo.com/322291024">Trees, Fibonacci Numbers, and Nested Recurrences</a>, Rutgers University Experimental Math Seminar, Mar 07, 2019

%Y Cf. A046699, A278038, A278045, A316628.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Mar 07 2019

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 January 18 16:27 EST 2020. Contains 331011 sequences. (Running on oeis4.)