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.
%I A364377 #9 Jul 29 2023 03:22:14 %S A364377 0,0,1,0,2,0,0,1,0,2,3,0,0,1,0,2,0,0,1,0,4,0,0,1,0,2,0,0,1,0,2,3,0,0, %T A364377 1,0,2,0,0,1,0,4,5,0,0,1,0,2,0,0,1,0,2,3,0,0,1,0,2,0,0,1,0,4,0,0,1,0, %U A364377 2,0,0,1,0,2,3,0,0,1,0,2,0,0,1,0,6,0,0 %N A364377 The number of trailing 0's in the representation of n in Jacobsthal greedy base (A265747). %C A364377 The first position of k, for k = 0, 1, 2, ..., is A001045(k+2). %C A364377 The asymptotic density of the occurrences of 2*k is 9/4^(k+2), and of 2*k+1 is 3/4^(k+2), both for k >= 0. %C A364377 The asymptotic mean of this sequence is 11/12, and its asymptotic standard deviation is sqrt(283)/12. %H A364377 Amiram Eldar, <a href="/A364377/b364377.txt">Table of n, a(n) for n = 1..10000</a> %t A364377 a[n_] := IntegerExponent[A265747[n], 10]; Array[a, 100] (* using A265747[n] *) %o A364377 (PARI) a(n) = valuation(A265747(n), 10); \\ using A265747(n) %Y A364377 Cf. A001045, A265747, A324477. %K A364377 nonn,base %O A364377 1,5 %A A364377 _Amiram Eldar_, Jul 21 2023