cp's OEIS Frontend

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.

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).

This page as a plain text file.
%I A324477 #20 Jul 21 2023 04:10:17
%S A324477 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 A324477 16,17,18,19,19,20,21,21,21,21,21,22,23,24,24,25,26,26,26,27,28,29,29,
%U A324477 30,31,31,31,32,32,32,32,33,34,35,35,36,37,37,37,38,39,40,40
%N 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).
%H A324477 Amiram Eldar, <a href="/A324477/b324477.txt">Table of n, a(n) for n = 1..10000</a>
%H A324477 Nathan Fox, <a href="https://vimeo.com/322291024">Trees, Fibonacci Numbers, and Nested Recurrences</a>, Rutgers University Experimental Math Seminar, Mar 07, 2019.
%t A324477 Table[Table[k, {IntegerExponent[A265747[k], 10] + 1}], {k, 1, 40}] // Flatten (* _Amiram Eldar_, Jul 21 2023 using A265747[n] *)
%Y A324477 Cf. A001045, A265747, A364377.
%Y A324477 A046699, A316628, A324473 and A324475 have similar definitions.
%K A324477 nonn,base
%O A324477 1,2
%A A324477 _Nathan Fox_ and _N. J. A. Sloane_, Mar 09 2019
%E A324477 More terms from _Amiram Eldar_, Jul 21 2023