|
%I #22 Sep 21 2023 19:26:36
%S 0,1,10,11,95,96,100,101,105,106,110,111,115,116,120,121,125,126,130,
%T 131,135,136,140,141,895,896,950,951,955,956,960,961,965,966,970,971,
%U 975,976,980,981,985,986,990,991,995,996,1000,1001,1005,1006,1010,1011
%N Both n and n^2 have the same initial digit and also n and n^2 have the same final digit when expressed in base 10.
%C All terms of A045953 appear in this sequence.
%C Subsequence of A008851; A045953 and A046851 are subsequences. [_Reinhard Zumkeller_, Jul 27 2011]
%C Intersection of A008851 and A089951. - _Michel Marcus_, Mar 19 2015
%H Reinhard Zumkeller, <a href="/A086457/b086457.txt">Table of n, a(n) for n = 1..10000</a>
%F A000030(a(n)) = A000030(a(n)^2) and A010879(a(n)) = A010879(a(n)^2).
%e a(12) = 115 appears in the sequence because 115*115 = 13225.
%t ldQ[n_]:=Module[{idn=IntegerDigits[n],idn2=IntegerDigits[n^2]}, First[ idn] == First[idn2]&&Last[idn]==Last[idn2]]; Select[Range[ 0,1100], ldQ] (* _Harvey P. Dale_, Feb. 06 2011 *)
%o (BASIC)
%o left$(str$(n), 1) = left$(str$(n^2), 1) AND right$(str$(n), 1) = right$(str$(n^2), 1)
%o (Haskell)
%o a086457 n = a086457_list !! (n-1)
%o a086457_list = filter (\x -> a000030 x == a000030 (x^2) &&
%o a010879 x == a010879 (x^2)) [0..]
%o -- _Reinhard Zumkeller_, Jul 27 2011
%Y Cf. A045953, A086458.
%K base,easy,nonn
%O 1,3
%A _Jeremy Gardiner_, Jul 20 2003
%E Offset corrected by _Reinhard Zumkeller_, Jul 27 2011
|
