This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060539 Table by antidiagonals of number of ways of choosing k items from n*k. 9
 1, 1, 2, 1, 6, 3, 1, 20, 15, 4, 1, 70, 84, 28, 5, 1, 252, 495, 220, 45, 6, 1, 924, 3003, 1820, 455, 66, 7, 1, 3432, 18564, 15504, 4845, 816, 91, 8, 1, 12870, 116280, 134596, 53130, 10626, 1330, 120, 9, 1, 48620, 735471, 1184040, 593775, 142506, 20475, 2024, 153, 10 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Seiichi Manyama, Antidiagonals n = 1..140, flattened (first 20 antidiagonals from Harry J. Smith) H. J. Brothers, Pascal's Prism: Supplementary Material. FORMULA a(n) = binomial(n*k, k) = A007318(n*k, k) = A060538(n, k)/A060538(n-1, k). PROG (PARI) { i=0; for (m=1, 20, for (n=1, m, k=m - n + 1; write("b060539.txt", i++, " ", binomial(n*k, k))); ) } \\ Harry J. Smith, Jul 06 2009 CROSSREFS Rows include A000012, A000984, A005809, A005810, A001449, A004355, A004368. Columns include A000027, A000384, A006566, A060541. Main diagonal is A014062. Sequence in context: A092392 A128741 A175757 * A163269 A103905 A270967 Adjacent sequences:  A060536 A060537 A060538 * A060540 A060541 A060542 KEYWORD nonn,tabl AUTHOR Henry Bottomley, Apr 02 2001 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 December 11 01:07 EST 2019. Contains 329910 sequences. (Running on oeis4.)