Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Mar 22 2021 02:42:40
%S 81,841,8100,80089,801025,8003241,80013025,800041225,8000050249,
%T 80000162649,800001447184,8000004951184,80000001609984,
%U 800000042569984,8000000160998400,80000000297200369,800000000000150481,8000000001435765625,80000000000015048100
%N Smallest n-digit square starting with 8.
%F a(n) = ceiling(sqrt(8*10^(n-1)))^2. - _Sascha Kurz_, Mar 18 2002
%t nS[n_] := Module[{lr = Floor[Sqrt[n]]}, If[lr^2==n, lr^2, (lr + 1)^2]]; Table[nS[8 10^i], {i, 0, 20}]
%Y Cf. A000290, A035075 (roots), A045791, A067479 (2..9).
%K nonn,base,easy
%O 2,1
%A _Amarnath Murthy_, Feb 09 2002
%E More terms from _Harvey P. Dale_, Feb 17 2002
%E Incorrect a(1) removed by _Jon E. Schoenfield_, Mar 21 2021