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.

Showing 1-4 of 4 results.

A191484 Number of compositions of even natural numbers into 5 parts <= n.

Original entry on oeis.org

1, 16, 122, 512, 1563, 3888, 8404, 16384, 29525, 50000, 80526, 124416, 185647, 268912, 379688, 524288, 709929, 944784, 1238050, 1600000, 2042051, 2576816, 3218172, 3981312, 4882813, 5940688
Offset: 0

Views

Author

Adi Dani, Jun 03 2011

Keywords

Comments

Number of ways of placing an even number of indistinguishable objects in 5 distinguishable boxes with the condition that in each box can be at most n objects.

Examples

			a(1)=16 as there are 16 compositions of even natural numbers into 5 parts <= 1:
(0,0,0,0,0);
(0,0,0,1,1), (0,0,1,0,1), (0,0,1,1,0), (0,1,1,0,0), (0,1,0,1,0), (0,1,0,0,1), (1,1,0,0,0), (1,0,1,0,0), (1,0,0,1,0), (1,0,0,0,1);
(0,1,1,1,1), (1,0,1,1,1), (1,1,0,1,1), (1,1,1,0,1), (1,1,1,1,0).

Links

Crossrefs

Cf. A036486 (3 parts), A171714 (4 parts), A191489 (6 parts), A191494 (7 parts), A191495 (8 parts).

Programs

  • Magma
    [((n + 1)^5 + (1 + (-1)^n)/2 )/2: n in [0..40]]; // Vincenzo Librandi, Jun 16 2011
  • Mathematica
    Table[1/2*((n + 1)^5 + (1 + (-1)^n)*1/2), {n, 0, 25}]
LinearRecurrence[{5,-9,5,5,-9,5,-1},{1,16,122,512,1563,3888,8404},50] (* Harvey P. Dale, Nov 09 2011 *)

Formula

a(n) = ((n + 1)^5 + (1 + (-1)^n)/2 )/2.
a(n) = 5*a(n-1) - 9*a(n-2) + 5*a(n-3) + 5*a(n-4) - 9*a(n-5) + 5*a(n-6) - a(n-7).
G.f.: (16*x^4 + 41*x^3 + 51*x^2 + 11*x + 1)/((1-x)^6*(1+x)).

A191494 Number of compositions of even natural numbers in 7 parts <= n.

Original entry on oeis.org

1, 64, 1094, 8192, 39063, 139968, 411772, 1048576, 2391485, 5000000, 9743586, 17915904, 31374259, 52706752, 85429688, 134217728, 205169337, 306110016, 446935870, 640000000, 900544271, 1247178944, 1702412724, 2293235712, 3051757813, 4015905088
Offset: 0

Views

Author

Adi Dani, Jun 03 2011

Keywords

Comments

Number of ways of placing an even number of indistinguishable objects in 7 distinguishable boxes with the condition that in each box can be at most n objects.

Examples

			a(1)=64 and compositions of even natural numbers into 7 parts no greater than 1 are
:(0,0,0,0,0,0,0) --> 7!/7!0! =  1
:(0,0,0,0,0,1,1) --> 7!/5!2! = 21
:(0,0,0,1,1,1,1) --> 7!/3!4! = 35
:(0,1,1,1,1,1,1) --> 7!/1!6! =  7

Links

Crossrefs

Cf. A036486 (3 parts), A171714 (4 parts), A191484 (5 parts), A191489 (6 parts), A191495 (8 parts).

Programs

  • Magma
    [((n + 1)^7 + (1+(-1)^n)/2 )/2: n in [0..40]]; // Vincenzo Librandi, Jun 16 2011
  • Mathematica
    Table[1/2*((n + 1)^7 + (1 + (-1)^n)*1/2), {n, 0, 25}]

Formula

a(n) = ((n + 1)^7 + (1 + (-1)^n)/2 )/2.
G.f.: ( 1 + 57*x + 666*x^2 + 1786*x^3 + 1821*x^4 + 645*x^5 + 64*x^6 ) / ( (1+x)*(x-1)^8 ). - R. J. Mathar, Jun 08 2011

A191489 Number of compositions of even natural numbers into 6 parts <= n.

Original entry on oeis.org

1, 32, 365, 2048, 7813, 23328, 58825, 131072, 265721, 500000, 885781, 1492992, 2413405, 3764768, 5695313, 8388608, 12068785, 17006112, 23522941, 32000000, 42883061, 56689952, 74017945, 95551488, 122070313, 154457888
Offset: 0

Views

Author

Adi Dani, Jun 03 2011

Keywords

Comments

Number of ways of placing of an even number of indistinguishable objects in 6 distinguishable boxes with condition that in each box can be at most n objects.

Examples

			a(1)=32 compositions of even natural numbers in 6 parts <= 1 are
:(0,0,0,0,0,0)--> 6!/(6!0!) =  1
:(0,0,0,0,1,1)--> 6!/(4!2!) = 15
:(0,0,1,1,1,1)--> 6!/(2!4!) = 15
:(1,1,1,1,1,1)--> 6!/(0!6!) =  1
a(2)=365 compositions of even natural numbers in 6 parts <= 2 are
:(0,0,0,0,0,0)--> 6!/(6!0!0!) =  1
:(0,0,0,0,1,1)--> 6!/(4!2!0!) = 15
:(0,0,0,0,0,2)--> 6!/(5!0!1!) =  6
:(0,0,1,1,1,1)--> 6!/(2!4!0!) = 15
:(0,0,0,1,1,2)--> 6!/(3!2!1!) = 60
:(0,0,0,0,2,2)--> 6!/(4!0!2!) = 15
:(0,1,1,1,1,2)--> 6!/(1!4!1!) = 30
:(0,0,0,2,2,2)--> 6!/(3!0!3!) = 20
:(0,0,1,1,2,2)--> 6!/(2!2!2!) = 90
:(1,1,1,1,1,1)--> 6!/(0!6!0!) =  1
:(0,1,1,2,2,2)--> 6!/(1!2!3!) = 60
:(0,0,2,2,2,2)--> 6!/(2!0!4!) = 15
:(1,1,1,1,2,2)--> 6!/(0!4!2!) = 15
:(0,2,2,2,2,2)--> 6!/(1!0!5!) =  6
:(1,1,2,2,2,2)--> 6!/(0!2!4!) = 15
:(2,2,2,2,2,2)--> 6!/(0!0!6!) =  1

Links

Crossrefs

Cf. A036486 (3 parts), A171714 (4 parts), A191484 (5 parts), A191494 (7 parts), A191495 (8 parts).

Programs

  • Magma
    [((n + 1)^6 + (1+(-1)^n)/2 )/2: n in [0..40]]; // Vincenzo Librandi, Jun 16 2011
  • Mathematica
    Table[1/2*((n + 1)^6 + (1 + (-1)^n)*1/2), {n, 0, 25}]

Formula

a(n) = ((n + 1)^6 + (1+(-1)^n)/2 )/2.
G.f.: (x^2 + 10*x + 1)*(x^4 + 16*x^3 + 26*x^2 + 16*x + 1) / ( (1+x)*(1-x)^7 ). - R. J. Mathar, Jun 06 2011
a(2n) = A175113(n). - R. J. Mathar, Jun 07 2011

A191687 Table T(n,k) = ceiling((1/2)*((k+1)^n+(1+(-1)^k)/2)) read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 1, 4, 5, 2, 1, 1, 8, 14, 8, 3, 1, 1, 16, 41, 32, 13, 3, 1, 1, 32, 122, 128, 63, 18, 4, 1, 1, 64, 365, 512, 313, 108, 25, 4, 1, 1, 128, 1094, 2048, 1563, 648, 172, 32, 5, 1
Offset: 1

Views

Author

Adi Dani, Jun 11 2011

Keywords

Comments

T(n,k) is the number of compositions of even natural numbers into n parts <= k.

Examples

			Top left corner:
  1, 1, 1,  1,  1,...
  1, 1, 2,  2,  3,...
  1, 2, 5,  8, 13,...
  1, 4,14, 32, 63,...
  1, 8,41,128,313,...
T(2,4)=13: there are 13 compositions of even natural numbers into 2 parts <=4
0: (0,0);
2: (0,2), (2,0), (1,1);
4: (0,4), (4,0), (1,3), (3,1), (2,2);
6: (2,4), (4,2), (3,3);
8: (4,4).

Links

Crossrefs

Rows sums gives: A000012, A004526, A000982, A036486, A171714, A191484, A191489, A191494, A191495, A191496
Columns sums gives: A000012, A000079, A007051, A004171, A034478, A081341, A034494, A092811, A083884, A093143

Programs

  • Mathematica
    Table[Table[Ceiling[1/2*((k+1)^n+(1+(-1)^k)/2)],{n,0,9},{k,0,9}]]
Showing 1-4 of 4 results.

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

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