This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
For n=2, the second prime is 3, and 36 is the smallest square that begins with 3, so a(2) = 36. - _Michael B. Porter_, Sep 06 2016
A030666:= proc(x) local d; for d from 1 do if ceil(sqrt(10^d*x)) <= floor(sqrt(10^d*(x+1)-1)) then return ceil(sqrt(10^d*x))^2 fi od end proc: seq(A030666(ithprime(i)),i=1..100); # Robert Israel, Sep 05 2016
# Computes 10000 terms
for b from 1 to 10000 do
sw1:=-1;
for n from 0 to 1000000 do
len:=length(n);
if len=0 then len:=1; fi;
t2:=10^len*b+n;
if issqr(t2) then sw1:=1; lprint(b,t2); break; fi; od:
if sw1 < 0 then lprint("failed at",b); lprint(b,-1); fi;
od:
Comments