Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Jul 21 2023 04:10:17
%S 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,
%T 16,17,18,19,19,20,21,21,21,21,21,22,23,24,24,25,26,26,26,27,28,29,29,
%U 30,31,31,31,32,32,32,32,33,34,35,35,36,37,37,37,38,39,40,40
%N k appears t+1 times, where t = A364377(k) is the number of trailing zeros in the greedy Jacobsthal representation of k, A265747(k).
%H Amiram Eldar, <a href="/A324477/b324477.txt">Table of n, a(n) for n = 1..10000</a>
%H Nathan Fox, <a href="https://vimeo.com/322291024">Trees, Fibonacci Numbers, and Nested Recurrences</a>, Rutgers University Experimental Math Seminar, Mar 07, 2019.
%t Table[Table[k, {IntegerExponent[A265747[k], 10] + 1}], {k, 1, 40}] // Flatten (* _Amiram Eldar_, Jul 21 2023 using A265747[n] *)
%Y Cf. A001045, A265747, A364377.
%Y A046699, A316628, A324473 and A324475 have similar definitions.
%K nonn,base
%O 1,2
%A _Nathan Fox_ and _N. J. A. Sloane_, Mar 09 2019
%E More terms from _Amiram Eldar_, Jul 21 2023