cp's OEIS Frontend

A359344 Largest pandigital square with n digits.

%I A359344 #8 Dec 31 2022 02:12:55
%S A359344 9814072356,99853472016,998732401956,9998490637521,99992580137641,
%T A359344 999984024130576,9999925800137641,99999987340240516,
%U A359344 999999258000137641,9999999562540763281,99999992580000137641,999999991102375684521,9999999925800000137641,99999999986188478340025
%N A359344 Largest pandigital square with n digits.
%C A359344 Pandigital squares are perfect squares containing each digit from 0 to 9 at least once.
%C A359344 For number of digits n >= 14, every second term is of the form 9...92580...0137641 with n/2 - 3 leading nines and n/2 - 6 zeros after the middle three digits 258. This term is 9...9629^2 with n/2 - 3 leading nines. This is the case since ((10^m - 1)*10^3  + 629)^2 = 10^(2*m+6) - 2*10^(m+6) + 10^(m+6) + 258*10^(m+3) + 10^6 - 1258*10^3 + 395641 = (10^m - 1)*10^(m+6) + 258*10^(m+3) + 137641 with m = (n-6)/2 and n >= 14 even, and is the last n-digit square containing all digits from 0 to 9.
%F A359344 a(n) = (10^(n/2-3)-1)*10^(n/2+3) + 258*10^(n/2) + 137641 for n >= 14 even.
%p A359344 a:=proc(n::posint) local s, k, K: if n<10 then s:=NULL: else for k from floor(sqrt(10^n)) to ceil(sqrt(10^(n-1))) by -1 do K:=convert(k^2,base,10); if nops({op(K)})=10 then s:=k^2: break: fi: od: fi: return s; end:
%p A359344 seq(a(n),n=10..30);
%o A359344 (Python)
%o A359344 from math import isqrt
%o A359344 def c(n): return len(set(str(n))) == 10
%o A359344 def a(n):
%o A359344     ub, lb = isqrt(10**n-1), isqrt(10**(n-1)) if n&1 else isqrt(10**(n-1))+1
%o A359344     return next((k*k for k in range(ub, lb-1, -1) if c(k*k)), None)
%o A359344 print([a(n) for n in range(10, 24)]) # _Michael S. Branicky_, Dec 27 2022
%Y A359344 Cf. A225218, A359342, A359345.
%K A359344 nonn,base
%O A359344 10,1
%A A359344 _Martin Renner_, Dec 27 2022