login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133696 Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into parts k and n, 1<=k<=n. 2
1, 2, 0, 2, 1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 0, 0, 0, 1, 0, 2, 2, 2, 2, 1, 1, 0, 2, 4, 3, 0, 2, 1, 1, 0, 2, 3, 10, 4, 3, 5, 1, 1, 0, 2, 0, 5, 11, 0, 8, 2, 0, 1, 0, 2, 3, 6, 8, 9, 8, 5, 2, 1, 1, 0, 2, 6, 0, 0, 14, 78, 10, 0, 0, 1, 1, 0, 2, 4, 8, 14, 20, 23, 19, 13, 7, 3, 1, 1, 0, 2, 0, 9, 0, 29, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..99.

EXAMPLE

Binomial(8,2)=28: T(8,2)=#{3x8+4,2x8+3x4,8+5x4,7x4}=4;

Binomial(8,3)=56: T(8,3)=#{7x8,4x8+8x3,8+16x3}=3.

CROSSREFS

Sequence in context: A194317 A096810 A190436 * A195050 A127371 A036849

Adjacent sequences:  A133693 A133694 A133695 * A133697 A133698 A133699

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller, Dec 31 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 17:53 EDT 2020. Contains 334595 sequences. (Running on oeis4.)