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 A077347 #13 Jan 28 2025 14:21:11
%S A077347 1,225,361,441,5329,6400,7744,80089,90000,101124,112896,122500,135424,
%T A077347 145924,157609,165649,179776,1806336,1901641,2013561,2114116,2220100,
%U A077347 2325625,2427364,2528100,2637376,2742336,2845969,2951524,3059001
%N A077347 Final terms of rows of A077346.
%C A077347 a(n) = n-th square beginning with n. A018796 contains initial terms of rows. Subsidiary sequence: There can be a rearrangement of squares in groups so that the n-th group contains n squares beginning with n and not occurring earlier. E.g., the initial term of row 25 would be 256 and not 25 and accordingly the final terms would differ.
%H A077347 Robert Israel, <a href="/A077347/b077347.txt">Table of n, a(n) for n = 1..10000</a>
%p A077347 startsWith := proc(n,dig) local nshft ; nshft := n ; while nshft > dig do nshft := floor(nshft/10) ; od ; if dig = nshft then RETURN(true) ; else RETURN(false) ; fi ; end: A077347 := proc(n) local candid,c; candid := 1 ; for c from 1 to n do while not startsWith(candid^2,n) do candid := candid+1 ; od ; if c = n then RETURN(candid^2) ; fi ; candid := candid+1 ; od ; end: for n from 1 to 50 do printf("%a,",A077347(n)) ; od ; # _R. J. Mathar_, Nov 12 2006
%Y A077347 Cf. A018796, A077346, A077348, A077349.
%K A077347 base,nonn
%O A077347 1,2
%A A077347 _Amarnath Murthy_, Nov 05 2002
%E A077347 More terms from _R. J. Mathar_, Nov 12 2006