A026814 -id:A026814 - cp's OEIS frontend

A211863 Number of partitions of n into parts <= 8 with the property that all parts have distinct multiplicities.

1, 1, 2, 2, 4, 5, 7, 10, 13, 14, 20, 26, 28, 40, 49, 53, 71, 89, 95, 125, 136, 160, 192, 235, 248, 313, 348, 409, 458, 558, 592, 729, 785, 921, 1018, 1205, 1264, 1511, 1627, 1888, 2037, 2382, 2521, 2961, 3143, 3660, 3884, 4502, 4782, 5510

Offset: 0

Matthew C. Russell, Apr 25 2012

nonn

			For n=3 the a(3)=2 partitions are {3} and {1,1,1}. Note that {2,1} does not count, as 1 and 2 appear with the same nonzero multiplicity.

Doron Zeilberger, Using generatingfunctionology to enumerate distinct-multiplicity partitions.

Cf. A026814, A098859.

Cf. A105637, A211858, A211859, A211860, A211861, A211862.

a211863 n = p 0 [] [1..8] n where
   p m ms _      0 = if m `elem` ms then 0 else 1
   p    []     _ = 0
   p m ms ks'@(k:ks) x
     | x < k       = 0
     | m == 0      = p 1 ms ks' (x - k) + p 0 ms ks x
     | m `elem` ms = p (m + 1) ms ks' (x - k)
     | otherwise   = p (m + 1) ms ks' (x - k) + p 0 (m : ms) ks x
-- Reinhard Zumkeller, Dec 27 2012

A008641 Number of partitions of n into at most 12 parts.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 100, 133, 172, 224, 285, 366, 460, 582, 725, 905, 1116, 1380, 1686, 2063, 2503, 3036, 3655, 4401, 5262, 6290, 7476, 8877, 10489, 12384, 14552, 17084, 19978, 23334, 27156, 31570, 36578, 42333, 48849, 56297

Offset: 0

N. J. A. Sloane

With a different offset, number of partitions of n in which the greatest part is 12.

Also number of partitions of n into parts <= 12: a(n)=A026820(n,12). [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 361
Index entries for linear recurrences with constant coefficients, signature (1, 1, 0, 0, -1, 0, -1, 0, 0, 0, 0, 1, -1, 0, 2, 1, 1, 0, 0, -1, -1, -2, -1, -1, 0, -2, 0, 1, 2, 2, 2, 2, 1, 1, 0, -1, -2, -1, -4, -1, -2, -1, 0, 1, 1, 2, 2, 2, 2, 1, 0, -2, 0, -1, -1, -2, -1, -1, 0, 0, 1, 1, 2, 0, -1, 1, 0, 0, 0, 0, -1, 0, -1, 0, 0, 1, 1, -1).

a(n) = A008284(n+12, 12), n >= 0.

Cf. A026810, A026811, A026812, A026813, A026814, A026815, A026816.

1/(1-x)/(1-x^2)/(1-x^3)/(1-x^4)/(1-x^5)/(1-x^6)/(1-x^7)/(1-x^8)/(1-x^9)/(1-x^10)/(1-x^11)/(1-x^12)
with(combstruct):ZL13:=[S,{S=Set(Cycle(Z,card<13))}, unlabeled]:seq(count(ZL13,size=n),n=0..46); # Zerinvary Lajos, Sep 24 2007
B:=[S,{S = Set(Sequence(Z,1 <= card),card <=12)},unlabelled]: seq(combstruct[count](B, size=n), n=0..46); # Zerinvary Lajos, Mar 21 2009

CoefficientList[ Series[ 1/ Product[ 1 - x^n, {n, 1, 12} ], {x, 0, 60} ], x ]
Table[ Length[ Select[ Partitions[n], First[ # ] == 12 & ]], {n, 1, 60} ]

G.f.: 1/Product_{k=1..12}(1-x^k).

a(n) = a(n-1) + a(n-2) - a(n-5) - a(n-7) + a(n-12) - a(n-13) + 2*a(n-15) + a(n-16) + a(n-17) - a(n-20) - a(n-21) - 2*a(n-22) - a(n-23) - a(n-24) - 2*a(n-26) + a(n-28) + 2*a(n-29) + 2*a(n-30) + 2*a(n-31) + 2*a(n-32) + a(n-33) + a(n-34) - a(n-36) - 2*a(n-37) - a(n-38) - 4*a(n-39) - a(n-40) - 2*a(n-41) - a(n-42) + a(n-44) + a(n-45) + 2*a(n-46) + 2a(n-47) + 2*a(n-48) + 2*a(n-49) + a(n-50) - 2*a(n-52) - a(n-54) - a(n-55) - 2*a(n-56) - a(n-57) - a(n-58) + a(n-61) + a(n-62) + 2*a(n-63) - a(n-65) + a(n-66) - a(n-71) - a(n-73) + a(n-76) + a(n-77) - a(n-78). - David Neil McGrath, Jul 28 2015

More terms from Robert G. Wilson v, Dec 11 2000

A382864 Triangle read by rows: T(n,k) = T(n-k,k-1) + T(n-k,k) with T(0,0) = 1 for 0 <= k <= A003056(n).

Original entry on oeis.org

1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 2, 1, 0, 1, 3, 1, 0, 1, 3, 2, 0, 1, 4, 3, 0, 1, 4, 4, 1, 0, 1, 5, 5, 1, 0, 1, 5, 7, 2, 0, 1, 6, 8, 3, 0, 1, 6, 10, 5, 0, 1, 7, 12, 6, 1, 0, 1, 7, 14, 9, 1, 0, 1, 8, 16, 11, 2, 0, 1, 8, 19, 15, 3, 0, 1, 9, 21, 18, 5, 0, 1, 9, 24, 23, 7

Offset: 0

Seiichi Manyama, Apr 07 2025

			First few rows are:
  1;
  0, 1;
  0, 1;
  0, 1, 1;
  0, 1, 1;
  0, 1, 2;
  0, 1, 2,  1;
  0, 1, 3,  1;
  0, 1, 3,  2;
  0, 1, 4,  3;
  0, 1, 4,  4, 1;
  0, 1, 5,  5, 1;
  0, 1, 5,  7, 2;
  0, 1, 6,  8, 3;
  0, 1, 6, 10, 5;
  0, 1, 7, 12, 6, 1;
  ...

Seiichi Manyama, Rows n = 0..481, flattened

Row sums give A000009.
Columns 0..10 give A000007, A000012, A004526(n-1), A069905(n-3), A026810(n-6), A026811(n-10), A026812(n-15), A026813(n-21), A026814(n-28), A026815(n-36), A026816(n-45).
Cf. A003056, A008284, A291954, A291960, A291968, A292047, A292049.

G.f. of column k: x^(k*(k+1)/2) / Product_{j=1..k} (1-x^j).

T(n,k) = |A292047(n,k)| = |A292049(n,k)|.

cp's OEIS Frontend

A211863 Number of partitions of n into parts <= 8 with the property that all parts have distinct multiplicities.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Haskell

A008641 Number of partitions of n into at most 12 parts.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A382864 Triangle read by rows: T(n,k) = T(n-k,k-1) + T(n-k,k) with T(0,0) = 1 for 0 <= k <= A003056(n).

Views

Author

Keywords

Examples

Links

Crossrefs

Formula