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.
%I A110460 #15 Sep 25 2023 07:50:22 %S A110460 1,6,9,744,4179600,8448511339584,5768007101259200000000000049, %T A110460 5174534068654382362457957919012519218990703784333328400, %U A110460 2738806678866818978778889262772030983678218158753649709561749318814684327986697592167893627634348717226004356 %N A110460 Least multiple of n such that every concatenation a(1)...a(i) for 1 <= i <= n is a perfect square. %e A110460 1, 16, 169, 169744 are all squares. [corrected by _Harvey P. Dale_, Aug 06 2019] %o A110460 (PARI) f(n, num) = local(d, x); d = 1; while (1, x = sqrtint(num*10^d + 10^(d - 1) - 1) + 1; while (x^2 < (num + 1)*10^d && (x^2%10^d)%n, x++); if (x^2 < (num + 1)*10^d, return([x^2, x^2%10^d])); d++); %o A110460 num = 0; for (n = 1, 10, p = f(n, num); print1(p[2], ", "); num = p[1]); \\ _David Wasserman_, Dec 03 2008 %Y A110460 Cf. A061110. %K A110460 base,nonn %O A110460 1,2 %A A110460 _Amarnath Murthy_, Aug 04 2005 %E A110460 More terms from _David Wasserman_, Dec 03 2008 %E A110460 Clarified definition. - _N. J. A. Sloane_, Sep 25 2023