login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324473 k appears A278045(k)+1 times. 3
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, 16, 17, 17, 17, 18, 189, 19, 20, 20, 20, 20, 21, 22, 22, 23, 24, 24, 24, 24, 24, 24, 25, 26, 26, 27, 28, 28, 28, 29, 30, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

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.

LINKS

Table of n, a(n) for n=1..60.

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

CROSSREFS

Cf. A046699, A278038, A278045, A316628.

Sequence in context: A213718 A092038 A269990 * A159481 A194206 A307482

Adjacent sequences:  A324470 A324471 A324472 * A324474 A324475 A324476

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Mar 07 2019

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 December 13 08:08 EST 2019. Contains 329968 sequences. (Running on oeis4.)