login
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.
3

%I #11 Nov 14 2024 11:03:41

%S 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 10,11,11,11,11,11,12,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,14,

%U 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 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 This sequence is a base-10 variant of A167500.

%C Numbers corresponding to positions of zeros do not appear in the sequence.

%C This sequence first differ from A001462 for n = 169: a(169) = 31 whereas A001462(169) = 29.

%H Rémy Sigrist, <a href="/A377862/b377862.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A377862/a377862.png">Scatterplot of the first 500 of this sequence and of A001462</a>

%H Rémy Sigrist, <a href="/A377862/a377862.gp.txt">PARI program</a>

%o (PARI) \\ See Links section.

%Y Cf. A001462, A087739, A167500, A377863 (missing numbers), A377896.

%K nonn,base

%O 1,2

%A _Rémy Sigrist_, Nov 10 2024