This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A136406 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. 2
 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; refs; listen; history; text; internal format)
 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). The sum of the n^th row is A004101(n). [From Benoit Jubin, Sep 01 2008] LINKS CROSSREFS 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 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 21 06:55 EDT 2019. Contains 325192 sequences. (Running on oeis4.)