login
A088231
Triangle read by rows: T(n,k) = number of squares not less than n-k and not greater n+k, 0<=k<n.
0
1, 0, 1, 0, 1, 2, 1, 1, 1, 2, 0, 1, 1, 1, 3, 0, 0, 1, 2, 2, 3, 0, 0, 1, 2, 2, 2, 3, 0, 1, 1, 1, 2, 2, 2, 3, 1, 1, 1, 1, 1, 2, 2, 3, 4, 0, 1, 1, 1, 1, 1, 3, 3, 3, 4, 0, 0, 1, 1, 1, 2, 2, 3, 3, 3, 4, 0, 0, 0, 1, 2, 2, 2, 2, 3, 3, 3, 4, 0, 0, 0, 1, 2, 2, 2, 2, 2, 3, 3, 3, 5, 0, 0, 1, 1, 1, 2, 2, 2, 2, 2, 3
OFFSET
1,6
COMMENTS
T(n,0) = A010052(n); T(n,n-1) = A000196(2*n-1).
MATHEMATICA
T[n_, k_] := Select[Range[n-k, n+k], IntegerQ@Sqrt@#&] // Length;
Table[T[n, k], {n, 1, 14}, {k, 0, n-1}] // Flatten (* Jean-François Alcover, Sep 15 2021 *)
CROSSREFS
Sequence in context: A320835 A276183 A056563 * A327954 A336386 A378622
KEYWORD
nonn,tabl
AUTHOR
Reinhard Zumkeller, Nov 03 2003
STATUS
approved