id:A136406 - OEIS Search Results

Search: id:A136406

Displaying 1-1 of 1 results found.

page 1

Array 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.

+0
3

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 (list; table; graph; listen)

	OFFSET	`1,8`
	COMMENT	`T(n,1) = T(n,n) = 1.` `T(n,n-k) does not depend on k if k <= floor(n/2).` `The sum of the n^th row is A004101(n). [From Benoit Jubin (benoit_jubin(AT)yahoo.fr), Sep 01 2008]`
	CROSSREFS	`Sequence in context: A136148 A132409 A030337 this_sequence A026568 A138361 A030408` `Adjacent sequences: A136403 A136404 A136405 this_sequence A136407 A136408 A136409`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Benoit Jubin (benoit_jubin(AT)yahoo.fr), Apr 13 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 13:42 EST 2009. Contains 167481 sequences.

AT&T Labs Research