OFFSET
1,1
COMMENTS
Marginal; included only because it appears in a well-known book of puzzles.
In the first 2,500 terms, only one term appears more than 8 times -- 12346 appears 14 times. - Harvey P. Dale, Aug 04 2024
REFERENCES
GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See pages 119 and 318.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..2500
MATHEMATICA
FromDigits/@Partition[Flatten[Table[Flatten[IntegerDigits/@Divisors[n]], {n, 40}]], 5] (* Harvey P. Dale, Aug 04 2024 *)
PROG
(Python)
from sympy import divisors
from itertools import chain, count, islice
def dgen():
for n in count(1): yield from "".join(map(str, divisors(n)))
def agen(): # generator of terms
g = dgen()
yield from (int("".join(islice(g, 5))) for n in count(1))
print(list(islice(agen(), 38))) # Michael S. Branicky, Apr 23 2023
CROSSREFS
KEYWORD
nonn,base,less
AUTHOR
N. J. A. Sloane, Apr 22 2023
STATUS
approved