A324477 k appears t+1 times, where t = A364377(k) is the number of trailing zeros in the greedy Jacobsthal representation of k, A265747(k).

1, 2, 3, 3, 4, 5, 5, 5, 6, 7, 8, 8, 9, 10, 10, 10, 11, 11, 11, 11, 12, 13, 14, 14, 15, 16, 16, 16, 17, 18, 19, 19, 20, 21, 21, 21, 21, 21, 22, 23, 24, 24, 25, 26, 26, 26, 27, 28, 29, 29, 30, 31, 31, 31, 32, 32, 32, 32, 33, 34, 35, 35, 36, 37, 37, 37, 38, 39, 40, 40

Offset

1,2

Links

Amiram Eldar, 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.

Mathematica

Table[Table[k, {IntegerExponent[A265747[k], 10] + 1}], {k, 1, 40}] // Flatten (* Amiram Eldar, Jul 21 2023 using A265747[n] *)

Crossrefs

Cf. A001045, A265747, A364377.

A046699, A316628, A324473 and A324475 have similar definitions.

Sequence in context: A241151 A073092 A088023 * A287292 A260717 A282719

Adjacent sequences: A324474 A324475 A324476 * A324478 A324479 A324480

Keyword

nonn,base

Author

Nathan Fox and N. J. A. Sloane, Mar 09 2019

Extensions

More terms from Amiram Eldar, Jul 21 2023

Status

approved