|
|
A111444
|
|
Triangle read by rows: row n contains the first n squares ending in n^2.
|
|
2
|
|
|
1, 4, 64, 9, 49, 169, 16, 2116, 2916, 9216, 25, 225, 625, 1225, 2025, 36, 1936, 3136, 8836, 11236, 20736, 49, 1849, 3249, 8649, 11449, 20449, 24649, 64, 1764, 3364, 8464, 11664, 20164, 24964, 36864, 81, 1681, 3481, 8281, 11881, 19881, 25281, 36481, 43681
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1;
4,64;
9,49,169;
16,2116,2916,9216;
25,225,625,1225,2025;
|
|
MAPLE
|
p:=proc(n) local c2, A, k: c2:=proc(x, y) local s: s:=proc(m) nops(convert(m, base, 10)) end: x*10^s(y)+y: end: A:={}: for k from 0 to 10000 do if type(sqrt(c2(k, n^2)), integer)=true then A:=A union {c2(k, n^2)} else A:=A: fi: od: seq(A[j], j=1..n): end: for n from 1 to 10 do p(n) od; # yields sequence in triangular form; c2 concatenates x and y # Emeric Deutsch, Aug 05 2005
|
|
MATHEMATICA
|
row[n_] := Reap[For[k = n; cnt = 0, cnt < n, k++, idn = IntegerDigits[n^2] // Reverse; idk = IntegerDigits[k^2] // Reverse; If[idk[[;; Length[idn]]] == idn, cnt++; Sow[k^2]]]][[2, 1]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|