OFFSET
1,10
LINKS
Paolo P. Lava, Table of n, a(n) for n = 1..10000
Paolo P. Lava, Digit charts for the first 20000 terms
Paolo P. Lava, First 1000 terms
Carlos Rivera, Puzzle 1182. Another sequence by Paolo Lava, The Prime Puzzles and Problems Connection.
MAPLE
P:=proc(q) local a, b, c, n; a:=[1]; b:=[1];
for n from 2 to q do c:=numboccur(n mod 10, b); a:=[op(a), c];
if c=0 then b:=[op(b), 0]; else b:=[op(b), op(convert(c, base, 10))]; fi; od;
print(op(a)); end: P(10^3);
PROG
(Python)
from itertools import count, islice
def agen(): # generator of terms
s = "1"
yield 1
for n in count(2):
an = s.count(str(n%10))
s += str(an)
yield an
print(list(islice(agen(), 82))) # Michael S. Branicky, Aug 02 2024
(Python)
from collections import Counter
def A375078_gen(): # generator of terms
c, n = Counter({1:1}), 1
yield 1
while True:
n = (n+1)%10
yield c[n]
c += Counter(map(int, str(c[n])))
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Paolo P. Lava, Jul 29 2024
STATUS
approved