The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A353081 Numbers whose squares have the first two digits the same as the next two digits. 1

%I #15 Apr 24 2022 20:52:10

%S 201,264,402,482,603,689,772,804,932,964,1005,1101,1146,1231,1557,

%T 1798,1907,2010,2035,2084,2132,2202,2357,2582,2640,2659,2678,2734,

%U 2878,3015,3114,3179,3334,3482,3624,3761,3893,4020,4021,4144,4264,4381,4495,4606,4714,4820,4924

%N Numbers whose squares have the first two digits the same as the next two digits.

%F 201^2 = 40401 and 264^2 = 69696. Thus, both 201 and 264 are in this sequence.

%p q:= n-> (s-> is(s[1..2]=s[3..4]))(""||(n^2)):

%p select(q, [$32..10000])[]; # _Alois P. Heinz_, Apr 22 2022

%t Select[Range[32, 5000], Take[IntegerDigits[#^2], {1, 2}] == Take[IntegerDigits[#^2], {3, 4}] &]

%o (Python)

%o def ok(n): s = str(n**2); return len(s) > 3 and s[:2] == s[2:4]

%o print([k for k in range(5000) if ok(k)]) # _Michael S. Branicky_, Apr 22 2022

%o (PARI) do(n)=my(v=List()); for(a=1,9, for(b=0,9, my(N=10^(n-4), t=(1010*a+101*b)*N-1); for(k=sqrtint(t)+1,sqrtint(t+N), listput(v,k)))); Vec(v) \\ finds terms corresponding to n-digit squares; _Charles R Greathouse IV_, Apr 24 2022

%Y Cf. A123912, A353080.

%K nonn,base,easy

%O 1,1

%A _Tanya Khovanova_, Apr 22 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 June 15 22:50 EDT 2024. Contains 373412 sequences. (Running on oeis4.)