A136406 Triangle read by rows: T(n,k) is the number of bi-partitions of the pair (n,k) into pairs (n_i,k_i) of positive integers such that sum k_i = k and sum n_i*k_i^2 = n.

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 3, 1, 1, 1, 3, 4, 3, 1, 1, 1, 3, 5, 4, 3, 1, 1, 1, 5, 6, 8, 4, 3, 1, 1, 1, 4, 10, 8, 8, 4, 3, 1, 1, 1, 5, 10, 14, 11, 8, 4, 3, 1, 1, 1, 5, 12, 16, 17, 11, 8, 4, 3, 1, 1, 1, 7, 14, 23, 21, 21, 11, 8, 4, 3, 1, 1, 1, 6, 17, 25, 32, 24, 21, 11, 8, 4, 3, 1, 1

Offset

1,8

Comments

T(n,1) = T(n,n) = 1.

T(n,n-k) does not depend on k if k <= floor(n/2).

Links

Andrew Howroyd, Table of n, a(n) for n = 1..1275

Example

Triangle begins:
  1,
  1, 1;
  1, 1,  1;
  1, 3,  1,  1;
  1, 2,  3,  1,  1;
  1, 3,  4,  3,  1,  1;
  1, 3,  5,  4,  3,  1, 1;
  1, 5,  6,  8,  4,  3, 1, 1;
  1, 4, 10,  8,  8,  4, 3, 1, 1;
  1, 5, 10, 14, 11,  8, 4, 3, 1, 1;
  1, 5, 12, 16, 17, 11, 8, 4, 3, 1, 1;
  ...

Prog

(PARI)
P(k, w, n)={prod(i=1, k, 1 - x^(i*w) + O(x*x^(n-k*w)))}
T(n)={Vecrev(polcoef(prod(w=1, sqrtint(n), sum(k=0, n\w^2, (x^w*y)^(k*w) / P(k, w^2, n))), n)/y)}
{ for(n=1, 10, print(T(n))) } \\ Andrew Howroyd, Oct 23 2019

Crossrefs

Row sums are A004101.

Cf. A136405, A137504.

Sequence in context: A269976 A132409 A030337 * A242222 A247198 A305319

Adjacent sequences: A136403 A136404 A136405 * A136407 A136408 A136409

Keyword

nonn,tabl

Author

Benoit Jubin, Apr 13 2008

Extensions

Terms a(68) and beyond from Andrew Howroyd, Oct 22 2019

Status

approved