login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A357915
Concatenation of the decimal digits of {n, 1..n}.
1
11, 212, 3123, 41234, 512345, 6123456, 71234567, 812345678, 9123456789, 1012345678910, 111234567891011, 12123456789101112, 1312345678910111213, 141234567891011121314, 15123456789101112131415, 1612345678910111213141516
OFFSET
1,1
COMMENTS
Concatenation of the consecutive integers 1..n, with n prepended (n > 0).
The terms a(1), a(7), a(31), and a(337) are primes (of the form n1...n).
a(3643) is a 13469-digit probable prime (the number of digits is also a prime).
These indices 7, 31, 337, 3643 are themselves primes of the form 6m+1.
For the known terms a(n) which are primes and for a(3643), a(n) == 2 (mod 3).
There is no other prime term for n < 15000 (and no prime term with prime index n < 25000).
LINKS
G. L. Honaker, Jr. and Chris K. Caldwell, Prime Curios! 71234567
FORMULA
a(n) = concat(n, A007908(n)).
EXAMPLE
a(2) = 212 since it is the concatenation of the consecutive positive integers <= 2, with 2 prepended.
MATHEMATICA
aUpTo[n_] := Table[ FromDigits @ Flatten @ IntegerDigits @ {i, Range @ i}, {i, n}]; aUpTo[999]
PROG
(PARI) a(n) = my(s=Str(n)); for(k=1, n, s=Str(s, k)); eval(s); \\ Michel Marcus, Jan 20 2023
(Python)
def a(n): return int(str(n)+"".join(map(str, range(1, n+1))))
print([a(n) for n in range(1, 17)]) # Michael S. Branicky, Jan 20 2023
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Mikk Heidemaa, Jan 18 2023
STATUS
approved