login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A359343 Square roots of least pandigital squares with n digits. 2

%I #15 Jan 05 2023 18:59:39

%S 32043,100287,317096,1000287,3162426,10000287,31622792,100000287,

%T 316227814,1000000287,3162277718,10000000287,31622776661,100000000287,

%U 316227766026,1000000000287,3162277660177,10000000000287,31622776601685,100000000000287,316227766016843

%N Square roots of least pandigital squares with n digits.

%C Pandigital squares are perfect squares containing each digit from 0 to 9 at least once.

%F a(n) = sqrt(A359342(n)).

%F If n is odd, a(n) = 10^((n-1)/2) + 287. - _Robert Israel_, Dec 29 2022

%F a(n) = 10^((n-1)/2) + O(1). - _Charles R Greathouse IV_, Dec 30 2022

%p f:= proc(n); local k;

%p for k from ceil(10^((n-1)/2)) do

%p if convert(convert(k^2,base,10),set) = {$0..9} then return k fi

%p od

%p end proc:

%p map(f, [$10..30]); # _Robert Israel_, Dec 29 2022

%o (Python)

%o from math import isqrt

%o def c(n): return len(set(str(n))) == 10

%o def a(n): return next((k for k in range(isqrt(10**(n-1))+1, isqrt(10**n-1)+1) if c(k*k)), None)

%o print([a(n) for n in range(10, 31)]) # _Michael S. Branicky_, Dec 27 2022

%Y Cf. A359342, A359345.

%K nonn,base

%O 10,1

%A _Martin Renner_, Dec 27 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 04:39 EDT 2024. Contains 375931 sequences. (Running on oeis4.)