A350673 - OEIS

A350673

Square array read by antidiagonals T(n, k), n, k >= 0; T(n, k) is the sum of the elements of the intersection of the multisets of positive squares summing to n and k, respectively, obtained by the greedy algorithm.

0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 0, 2, 2, 0, 0, 0, 1, 0, 3, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 4, 1, 2, 1, 0, 0, 0, 2, 2, 4, 4, 2, 2, 0, 0, 0, 0, 0, 3, 4, 5, 4, 3, 0, 0, 0, 0, 1, 0, 0, 4, 5, 5, 4, 0, 0, 1, 0, 0, 1, 1, 0, 4, 5, 6, 5, 4, 0, 1, 1, 0

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

0,13

LINKS

Table of n, a(n) for n=0..90.

Rémy Sigrist, PARI program for A350673

FORMULA

T(n, k) = T(k, n).

T(n, n) = n.

T(n, 0) = T(0, k) = 0.

EXAMPLE

Array T(n, k) begins: