|
%I #28 Dec 30 2020 07:46:55
%S 0,449,981961,9819619801,981961980196721,981961980199856194481,
%T 9819619801998569980018946081,981961980199856998001999824499740169,
%U 981961980199856998001999824499980001989039601,9819619801998569980019998244999800019999508849977812321
%N a(n) is the largest prime whose decimal expansion consists of the concatenation of a 1-digit square, a 2-digit square, a 3-digit square, ..., and an n-digit square, or 0 if there is no such prime.
%C If a(n) exists it has A000217(n)= n*(n+1)/2 digits.
%C All the terms end with 1 or 9.
%H David A. Corneth, <a href="/A339978/b339978.txt">Table of n, a(n) for n = 1..40</a> (first 16 terms from Michael S. Branicky)
%e a(1) = 0 because no 1-digit square {0, 1, 4, 9} is prime.
%e a(2) = 449 because 464, 481, 916, 925, 936, 949, 964, and 981 are not primes and 449, concatenation of 4 = 2^2 with 49 = 7^2, is prime.
%e a(4) = 9819619801, which is a prime is the concatenation of 9 = 3^2 with 81 = 9^2, then 961 = 31^2 and 9801 = 99^2. Observation, 9, 81, 961 and 9801 are the largest squares with respectively 1, 2, 3 and 4 digits.
%o (Python)
%o from sympy import isprime
%o from itertools import product
%o def a(n):
%o squares = [str(k*k) for k in range(1, int((10**n)**.5)+2)]
%o revsqrs = [[kk for kk in squares if len(kk)==i+1][::-1] for i in range(n)]
%o for t in product(*revsqrs):
%o intt = int("".join(t))
%o if isprime(intt): return intt
%o return 0
%o print([a(n) for n in range(1, 11)]) # _Michael S. Branicky_, Dec 25 2020
%Y Cf. A000290, A003618, A061433 (largest squares), A338968 (concatenate primes).
%K nonn,base
%O 1,2
%A _Bernard Schott_, Dec 25 2020
%E a(5)-a(10) from _Michael S. Branicky_, Dec 25 2020
| 