cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-20 of 24 results. Next

A180286 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 6.

Original entry on oeis.org

6, 42, 224, 1080, 4950, 22022, 96030, 412698, 1754116, 7391475, 30931296, 128709040, 533063220, 2199009840, 9040786150, 37061007270, 151538768920, 618244490589, 2517320600894, 10231810963750, 41522339189370, 168265272591000, 681003190888020, 2752938854265495
Offset: 6

Views

Author

R. H. Hardin, Aug 24 2010

Keywords

Links

Crossrefs

Column 6 of A180281.

Programs

  • Maple
    b:= proc(n, i, k) option remember; `if`(n=0, 1,
      `if`(i=0, 0, add(b(n-j, i-1, k), j=0..min(n, k))))
    end:
a:= n-> (k-> b(n$2, k)-b(n$2, k-1))(6):
seq(a(n), n=6..30);  # Alois P. Heinz, Aug 17 2018

A180287 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 7.

Original entry on oeis.org

7, 56, 324, 1650, 7865, 36036, 160888, 705341, 3050775, 13058840, 55439448, 233792568, 980496216, 4093094950, 17019665530, 70531676215, 291437684571, 1201142528876, 4939265410000, 20270259161100, 83038283251560, 339624292672665, 1387038195648525
Offset: 7

Views

Author

R. H. Hardin, Aug 24 2010

Keywords

Links

Crossrefs

Column 7 of A180281.

Programs

  • Maple
    b:= proc(n, i, k) option remember; `if`(n=0, 1,
      `if`(i=0, 0, add(b(n-j, i-1, k), j=0..min(n, k))))
    end:
a:= n-> (k-> b(n$2, k)-b(n$2, k-1))(7):
seq(a(n), n=7..30);  # Alois P. Heinz, Aug 17 2018

A180288 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 8.

Original entry on oeis.org

8, 72, 450, 2420, 12012, 56784, 259896, 1162800, 5116200, 22225256, 95585220, 407785239, 1728221950, 7284060210, 30558007920, 127687306230, 531713205764, 2207528270000, 9140975106900, 37763141619645, 155684014548300, 640640532117270, 2631842094963600
Offset: 8

Views

Author

R. H. Hardin, Aug 24 2010

Keywords

Links

Crossrefs

Column 8 of A180281.

Programs

  • Maple
    b:= proc(n, i, k) option remember; `if`(n=0, 1,
      `if`(i=0, 0, add(b(n-j, i-1, k), j=0..min(n, k))))
    end:
a:= n-> (k-> b(n$2, k)-b(n$2, k-1))(8):
seq(a(n), n=8..35);  # Alois P. Heinz, Aug 17 2018

A180289 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 9.

Original entry on oeis.org

9, 90, 605, 3432, 17745, 86632, 406980, 1860480, 8335338, 36773397, 160286166, 691906090, 2963163525, 12606797973, 53339223410, 224614532520, 942028278750, 3936923432325, 16402410574875, 68151368796840, 282481941399420, 1168338215983320, 4822856224887175
Offset: 9

Views

Author

R. H. Hardin, Aug 24 2010

Keywords

Links

Crossrefs

Column 9 of A180281.

Programs

  • Maple
    b:= proc(n, i, k) option remember; `if`(n=0, 1,
      `if`(i=0, 0, add(b(n-j, i-1, k), j=0..min(n, k))))
    end:
a:= n-> (k-> b(n$2, k)-b(n$2, k-1))(9):
seq(a(n), n=9..35);  # Alois P. Heinz, Aug 17 2018

A180290 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 10.

Original entry on oeis.org

10, 110, 792, 4732, 25480, 128520, 620160, 2899248, 13238478, 59366450, 262462010, 1147168890, 4967384268, 21343050399, 91106371800, 386747415000, 1633923070650, 6874432183125, 28818381635736, 120425375772240, 501810628742380, 2085780218807405, 8650033511799424
Offset: 10

Views

Author

R. H. Hardin, Aug 24 2010

Keywords

Links

Crossrefs

Column 10 of A180281.

Programs

  • Maple
    b:= proc(n, i, k) option remember; `if`(n=0, 1,
      `if`(i=0, 0, add(b(n-j, i-1, k), j=0..min(n, k))))
    end:
a:= n-> (k-> b(n$2, k)-b(n$2, k-1))(10):
seq(a(n), n=10..35);  # Alois P. Heinz, Aug 17 2018

A180292 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-2.

Original entry on oeis.org

1, 18, 50, 90, 147, 224, 324, 450, 605, 792, 1014, 1274, 1575, 1920, 2312, 2754, 3249, 3800, 4410, 5082, 5819, 6624, 7500, 8450, 9477, 10584, 11774, 13050, 14415, 15872, 17424, 19074, 20825, 22680, 24642, 26714, 28899, 31200, 33620, 36162, 38829, 41624
Offset: 3

Views

Author

R. H. Hardin, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010

Keywords

Links

Crossrefs

(n-2)nd entry in rows of A180281.

Formula

Empirical: a(n)=n*binomial(n,n-2) for n>4.

A180293 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-3.

Original entry on oeis.org

1, 50, 195, 392, 672, 1080, 1650, 2420, 3432, 4732, 6370, 8400, 10880, 13872, 17442, 21660, 26600, 32340, 38962, 46552, 55200, 65000, 76050, 88452, 102312, 117740, 134850, 153760, 174592, 197472, 222530, 249900, 279720, 312132, 347282, 385320
Offset: 4

Views

Author

R. H. Hardin, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010

Keywords

Links

Crossrefs

(n-3)rd entry in rows of A180281.

Formula

Empirical: a(n) = n*binomial(n+1, n-2) for n>6.

A180294 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-4.

Original entry on oeis.org

1, 140, 735, 1652, 2970, 4950, 7865, 12012, 17745, 25480, 35700, 48960, 65892, 87210, 113715, 146300, 185955, 233772, 290950, 358800, 438750, 532350, 641277, 767340, 912485, 1078800, 1268520, 1484032, 1727880, 2002770, 2311575, 2657340, 3043287
Offset: 5

Views

Author

R. H. Hardin, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010

Keywords

Links

Crossrefs

n-4th entry in rows of A180281.

Formula

Empirical: a(n) = n*binomial(n+2,n-2) for n>8.

A180295 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-5.

Original entry on oeis.org

1, 392, 2716, 6804, 12825, 22022, 36036, 56784, 86632, 128520, 186048, 263568, 366282, 500346, 672980, 892584, 1168860, 1512940, 1937520, 2457000, 3087630, 3847662, 4757508, 5839904, 7120080, 8625936, 10388224, 12440736, 14820498
Offset: 6

Views

Author

R. H. Hardin, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010

Keywords

Links

Crossrefs

n-5th entry in rows of A180281

Formula

Empirical: a(n)=n*binomial(n+3,n-2) for n>10

A180296 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-6.

Original entry on oeis.org

1, 1106, 9912, 27600, 54450, 96030, 160888, 259896, 406980, 620160, 922488, 1343034, 1917993, 2691920, 3719100, 5065060, 6808230, 9041760, 11875500, 15438150, 19879587, 25373376, 32119472, 40347120, 50317960, 62329344, 76717872
Offset: 7

Views

Author

R. H. Hardin, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010

Keywords

Links

Crossrefs

n-6th entry in rows of A180281.

Formula

Empirical: a(n) = n*binomial(n+4,n-2) for n>12.
Previous Showing 11-20 of 24 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.