The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080438 Smallest square obtained by inserting one or more digits between every pair of consecutive digits of n^2. 0
 1, 4, 9, 196, 225, 3136, 4489, 6084, 841, 10000, 10201, 10404, 10609, 12996, 27225, 27556, 27889, 39204, 39601, 40000, 40401, 40804, 54289, 54756, 616225, 617796, 71289, 71824, 89401, 90000, 90601, 10036224, 1108809, 10150596, 1525225, 1920996 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS If n^2 has k digits, there are (k-1) places where digit insertion takes place, and a(n) contains at least 2k-1 digits. LINKS PROG (PARI) { a(n) =  m=Vec(Str(n^2)); r=0; k=#m-1; while(!r, forvec(w=vector(#m-2, i, [1, k-1]), v=vector(#w+1, i, if(i<=#w, w[i], k)-if(i>1, w[i-1])); forvec(u=vector(#v, i, [0, 10^v[i]-1]), t=m[1]; for(i=1, #v, if(#Str(u[i])

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

Last modified November 28 06:42 EST 2021. Contains 349401 sequences. (Running on oeis4.)