Rémy Sigrist, <a href="/A377862/b377862_1.txt">Table of n, a(n) for n = 1..10000</a>
Rémy Sigrist, <a href="/A377862/b377862_1.txt">Table of n, a(n) for n = 1..10000</a>
proposed
approved
editing
proposed
allocated for Rémy Sigrist
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.
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, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 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
1,2
(PARI) \\ See Links section.
allocated
nonn,base
Rémy Sigrist, Nov 10 2024
approved
editing
allocating
allocated
allocated for Rémy Sigrist
allocating
approved