A288344 -id:A288344 - cp's OEIS frontend

A288256 Number of decagons that can be formed with perimeter n.

1, 1, 2, 3, 5, 7, 11, 15, 21, 29, 40, 53, 71, 93, 121, 157, 200, 255, 321, 404, 500, 623, 762, 939, 1137, 1388, 1664, 2015, 2396, 2877, 3398, 4050, 4748, 5623, 6553, 7711, 8936, 10454, 12051, 14024, 16088, 18626, 21275, 24516, 27882, 31991, 36244, 41411, 46746

Offset: 10

Seiichi Manyama, Jun 07 2017

Number of (a1, a2, ... , a10) where 1 <= a1 <= ... <= a10 and a1 + a2 + ... + a9 > a10.

Seiichi Manyama, Table of n, a(n) for n = 10..10000
G. E. Andrews, P. Paule and A. Riese, MacMahon's Partition Analysis IX: k-gon partitions, Bull. Austral Math. Soc., 64 (2001), 321-329.
Index entries for linear recurrences with constant coefficients, signature (0, 1, 0, 1, 1, 0, -1, 0, -1, -1, 0, 0, 0, -1, 1, 0, 0, 0, 1, -1, 0, 0, 0, 2, 1, 1, 0, 1, -2, 1, -1, 0, -1, -1, -1, -1, 0, -1, 1, -2, 1, -1, 1, -1, 2, 1, 1, 1, 1, 2, -1, 1, -1, 1, -2, 1, -1, 0, -1, -1, -1, -1, 0, -1, 1, -2, 1, 0, 1, 1, 2, 0, 0, 0, -1, 1, 0, 0, 0, 1, -1, 0, 0, 0, -1, -1, 0, -1, 0, 1, 1, 0, 1, 0, -1).

Number of k-gons that can be formed with perimeter n: A005044 (k=3), A062890 (k=4), A069906 (k=5), A069907 (k=6), A288253 (k=7), A288254 (k=8), A288255 (k=9), this sequence (k=10).

G.f.: x^10/((1-x)*(1-x^2)* ... *(1-x^10)) - x^18/(1-x) * 1/((1-x^2)*(1-x^4)* ... *(1-x^18)).

a(2*n+18) = A026816(2*n+18) - A288344(n), a(2*n+19) = A026816(2*n+19) - A288344(n) for n >= 0.

A288341 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^6)).

Original entry on oeis.org

1, 2, 4, 7, 12, 19, 30, 44, 64, 90, 125, 169, 227, 298, 388, 498, 634, 797, 996, 1231, 1513, 1844, 2235, 2689, 3221, 3833, 4542, 5353, 6284, 7341, 8547, 9907, 11447, 13176, 15121, 17293, 19725, 22427, 25436, 28767, 32459, 36529, 41023, 45958, 51385, 57327

Offset: 0

Seiichi Manyama, Jun 08 2017

Number of partitions of at most n into at most 6 parts.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Richard J. Mathar, Size of the Set of Residues of Integer Powers of Fixed Exponent, 2017.
Index entries for linear recurrences with constant coefficients, signature (2, 0, -1, 0, -1, 1, -2, 2, 1, 0, 0, 0, -1, -2, 2, -1, 1, 0, 1, 0, -2, 1).

Number of partitions of at most n into at most k parts: A002621 (k=4), A002622 (k=5), this sequence (k=6), A288342 (k=7), A288343 (k=8), A288344 (k=9), A288345 (k=10).

Cf. A288253. Column 6 of A092905. A001402 (first differences).

x='x+O('x^99); Vec(1/((1-x)*prod(i=1, 6, (1-x^i)))) \\ Altug Alkan, Mar 28 2018

A288345 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^10)).

Original entry on oeis.org

1, 2, 4, 7, 12, 19, 30, 45, 67, 97, 139, 194, 269, 366, 494, 658, 870, 1137, 1477, 1900, 2430, 3083, 3890, 4874, 6078, 7533, 9294, 11406, 13940, 16955, 20545, 24787, 29800, 35688, 42600, 50670, 60088, 71024, 83714, 98377, 115305, 134771, 157138, 182746, 212038

Offset: 0

Seiichi Manyama, Jun 08 2017

Number of partitions of at most n into at most 10 parts.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Richard J. Mathar, Size of the Set of Residues of Integer Powers of Fixed Exponent, research paper, 2017.
Index entries for linear recurrences with constant coefficients, signature (2, 0, -1, 0, -1, 1, -1, 1, 0, 0, -1, 2, 0, 0, 1, -2, 0, -1, 0, 0, 0, -2, 3, 0, 1, 0, 1, 0, -1, 0, -1, 0, -3, 2, 0, 0, 0, 1, 0, 2, -1, 0, 0, -2, 1, 0, 0, -1, 1, -1, 1, 0, 1, 0, -2, 1).

Number of partitions of at most n into at most k parts: A002621 (k=4), A002622 (k=5), A288341 (k=6), A288342 (k=7), A288343 (k=8), A288344 (k=9), this sequence (k=10).

Cf. A008639 (first differences).

x='x+O('x^99); Vec(1/((1-x)*prod(i=1, 10, (1-x^i)))) \\ Altug Alkan, Mar 28 2018

A008638 Number of partitions of n into at most 9 parts.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 41, 54, 73, 94, 123, 157, 201, 252, 318, 393, 488, 598, 732, 887, 1076, 1291, 1549, 1845, 2194, 2592, 3060, 3589, 4206, 4904, 5708, 6615, 7657, 8824, 10156, 11648, 13338, 15224, 17354, 19720, 22380, 25331, 28629, 32278

Offset: 0

N. J. A. Sloane

For n > 8: also number of partitions of n into parts <= 9: a(n) = A026820(n, 9). - Reinhard Zumkeller, Jan 21 2010

A. Cayley, Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 10, p. 415.
H. Gupta et al., Tables of Partitions. Royal Society Mathematical Tables, Vol. 4, Cambridge Univ. Press, 1958, p. 2.

T. D. Noe, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 358
Index entries for related partition-counting sequences
Index entries for linear recurrences with constant coefficients, signature (1,1,0,0,-1,0,-1,0,0,-1,0,2,1,1,1,0, -1,-1,-1,-2,-1,-1,1,1,2,1,1,1,0, -1,-1,-1,-2,0,1,0,0,1,0,1,0,0,-1,-1,1)

Essentially same as A026815.
a(n) = A008284(n+9, 9), n >= 0.
Cf. A288344 (partial sums), A266777 (first differences).

CoefficientList[ Series[ 1/ Product[ 1 - x^n, {n, 1, 9} ], {x, 0, 60} ], x ]

G.f.: 1/Product_{k=1..9} (1 - q^k).
a(n) = floor((30*n^8 + 5400*n^7 + 405300*n^6 + 16443000*n^5 + 390533640*n^4 + 5486840100*n^3 + 43691213950*n^2 + 175052776500*n + 256697834389)/438939648000 + (n + 1)*(2*n^2 + 133*n + 2597)*(-1)^n/147456 + (-1)^n*((n + 1)*(n + 47)*(-1)^floor(n/3 + 2/3) + (2*n^2 + 90*n + 127)*(-1)^floor(n/3 + 1/3) + (n + 2)*(n + 40)*(-1)^floor(n/3))/17496 + 1/256*((-1)^((2*n + (-1)^n - 1)/4)*floor((n + 2)/2)) + 1/2). - Tani Akinari, Oct 20 2012
a(n) = a(n-9) + A008637(n). - Vladimír Modrák, Sep 28 2020
From Vladimír Modrák, Aug 09 2022: (Start)
a(n) = Sum_{i_1=0..floor(n/3)} Sum_{i_2=0..floor(n/4)} Sum_{i_3=0..floor(n/5)} Sum_{i_4=0..floor(n/6)} Sum_{i_5=0..floor(n/7)} Sum_{i_6=0..floor(n/8)} Sum_{i_7=0..floor(n/9)} ceiling((max(0, n + 1 - 3*i_1 - 4*i_2 - 5*i_3 - 6*i_4 - 7*i_5 - 8*i_6 - 9*i_7))/2).
a(n) = Sum_{i_1=0..floor(n/4)} Sum_{i_2=0..floor(n/5)} Sum_{i_3=0..floor(n/6)} Sum_{i_4=0..floor(n/7)} Sum_{i_5=0..floor(n/8)} Sum_{i_6=0..floor(n/9)} floor(((max(0, n + 3 - 4*i_1 - 5*i_2 - 6*i_3 - 7*i_4 - 8*i_5 - 9*i_6))^2+4)/12). (End)

A288342 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^7)).

Original entry on oeis.org

1, 2, 4, 7, 12, 19, 30, 45, 66, 94, 132, 181, 246, 328, 433, 564, 728, 929, 1177, 1477, 1841, 2277, 2799, 3417, 4150, 5010, 6019, 7194, 8561, 10140, 11964, 14057, 16457, 19195, 22315, 25854, 29865, 34391, 39493, 45224, 51654, 58844, 66877, 75823, 85776, 96820

Offset: 0

Seiichi Manyama, Jun 08 2017

Number of partitions of at most n into at most 7 parts.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Richard J. Mathar, Size of the Set of Residues of Integer Powers of Fixed Exponent, research paper, 2017.
Index entries for linear recurrences with constant coefficients, signature (2, 0, -1, 0, -1, 1, -1, 0, 1, 1, 0, 1, -2, 0, 0, -2, 1, 0, 1, 1, 0, -1, 1, -1, 0, -1, 0, 2, -1).

Number of partitions of at most n into at most k parts: A002621 (k=4), A002622 (k=5), A288341 (k=6), this sequence (k=7), A288343 (k=8), A288344 (k=9), A288345 (k=10).

Cf. A288254.

x='x+O('x^99); Vec(1/((1-x)*prod(i=1, 7, (1-x^i)))) \\ Altug Alkan, Mar 28 2018

A288343 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^8)).

Original entry on oeis.org

1, 2, 4, 7, 12, 19, 30, 45, 67, 96, 136, 188, 258, 347, 463, 609, 795, 1025, 1313, 1665, 2099, 2624, 3262, 4026, 4945, 6035, 7332, 8859, 10660, 12764, 15226, 18083, 21402, 25230, 29647, 34713, 40525, 47155, 54719, 63307, 73056, 84074, 96524, 110536, 126301

Offset: 0

Seiichi Manyama, Jun 08 2017

Number of partitions of at most n into at most 8 parts.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Richard J. Mathar, Size of the Set of Residues of Integer Powers of Fixed Exponent, 2017.
Index entries for linear recurrences with constant coefficients, signature (2, 0, -1, 0, -1, 1, -1, 1, -1, 1, 1, 1, -1, -1, 1, -2, 0, -1, 1, 0, 2, -1, 1, 1, -1, -1, -1, 1, -1, 1, -1, 1, 0, 1, 0, -2, 1).

Number of partitions of at most n into at most k parts: A002621 (k=4), A002622 (k=5), A288341 (k=6), A288342 (k=7), this sequence (k=8), A288344 (k=9), A288345 (k=10).

Cf. A288255.

CoefficientList[Series[1/((1-x)Times@@(1-x^Range[8])),{x,0,50}],x] (* Harvey P. Dale, Dec 06 2017 *)

x='x+O('x^99); Vec(1/((1-x)*prod(i=1, 8, (1-x^i)))) \\ Altug Alkan, Mar 28 2018

cp's OEIS Frontend

A288256 Number of decagons that can be formed with perimeter n.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A288341 Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^6)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A288345 Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^10)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A008638 Number of partitions of n into at most 9 parts.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A288342 Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^7)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A288343 Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^8)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A288341 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^6)).

A288345 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^10)).

A288342 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^7)).

A288343 Expansion of 1 / ((1-x)^2(1-x^2)(1-x^3)...(1-x^8)).