|
%I #12 Jan 05 2024 13:44:25
%S 1,1,1,1,1,1,4,4,1,4,1,1,4,1,1,1,4,4,9,9,1,9,1,1,9,1,1,1,9,4,9,4,1,9,
%T 4,1,1,16,16,1,16,1,1,16,1,1,1,16,4,16,4,1,16,4,1,1,16,4,1,1,1,16,4,4,
%U 25,25,1,25,1,1,25,1,1,1,25,4,25,4,1,25,4,1,1
%N Irregular table read by rows; the n-th row contains, in weakly decreasing order, the positive squares summing to n as obtained by the greedy algorithm.
%C The n-th row has A053610(n) terms.
%H Andrew Howroyd, <a href="/A350674/b350674.txt">Table of n, a(n) for n = 1..1733</a> (rows 1..500)
%F T(n, 1) = A048760(n).
%F T(n, A053610(n)) = A350698(n).
%e The first rows are:
%e 1: [1]
%e 2: [1, 1]
%e 3: [1, 1, 1]
%e 4: [4]
%e 5: [4, 1]
%e 6: [4, 1, 1]
%e 7: [4, 1, 1, 1]
%e 8: [4, 4]
%e 9: [9]
%e 10: [9, 1]
%e 11: [9, 1, 1]
%e 12: [9, 1, 1, 1]
%e 13: [9, 4]
%e 14: [9, 4, 1]
%e 15: [9, 4, 1, 1]
%e 16: [16]
%o (PARI) row(n,e=2) = { my (g=[], r); while (n, r=sqrtnint(n,e); n-=r^e; g=concat(g,[r^e])); g }
%Y Cf. A007961, A048760, A053610, A350698.
%K nonn,tabf
%O 1,7
%A _Rémy Sigrist_, Jan 10 2022
|
