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 A377862 #11 Nov 14 2024 11:03:41 %S A377862 1,2,2,3,3,4,4,4,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,9,10,10,10,10, %T A377862 10,11,11,11,11,11,12,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,14, %U A377862 14,15,15,15,15,15,15,16,16,16,16,16,16,16,17,17,17,17,17,17,17,18,18,18,18,18,18,18,19,19 %N A377862 A variant of Golomb's sequence (A001462): the n-th digit of the sequence gives the number of times n appears, with a(1) = 1 and a(2) = 2. %C A377862 This sequence is a base-10 variant of A167500. %C A377862 Numbers corresponding to positions of zeros do not appear in the sequence. %C A377862 This sequence first differ from A001462 for n = 169: a(169) = 31 whereas A001462(169) = 29. %H A377862 Rémy Sigrist, <a href="/A377862/b377862.txt">Table of n, a(n) for n = 1..10000</a> %H A377862 Rémy Sigrist, <a href="/A377862/a377862.png">Scatterplot of the first 500 of this sequence and of A001462</a> %H A377862 Rémy Sigrist, <a href="/A377862/a377862.gp.txt">PARI program</a> %o A377862 (PARI) \\ See Links section. %Y A377862 Cf. A001462, A087739, A167500, A377863 (missing numbers), A377896. %K A377862 nonn,base %O A377862 1,2 %A A377862 _Rémy Sigrist_, Nov 10 2024