login
A362446
Concatenate the terms of A027750 (omitting spaces and commas), chop into blocks of length 5, then omit any leading zeros.
1
11213, 12415, 12361, 71248, 13912, 51011, 11234, 61211, 31271, 41351, 51248, 16117, 12369, 18119, 12451, 2013, 72112, 11221, 23123, 46812, 24152, 51213, 26139, 27124, 71428, 12912, 35610, 15301, 31124, 81632, 13113, 31217, 34157, 35123, 46912, 18361, 37121, 93813
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
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
Cf. A027750.
Sequence in context: A190793 A247925 A359871 * A271582 A185797 A256355
KEYWORD
nonn,base,less
AUTHOR
N. J. A. Sloane, Apr 22 2023
STATUS
approved