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-8 of 8 results.

A358901 Number of integer partitions of n whose parts have all different numbers of prime factors (A001222).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 4, 4, 5, 5, 7, 9, 8, 9, 11, 11, 15, 16, 16, 18, 20, 22, 26, 28, 31, 32, 36, 40, 45, 46, 46, 50, 59, 64, 70, 75, 78, 83, 89, 94, 108, 106, 104, 120, 137, 142, 147, 150, 161, 174, 190, 200, 220, 226, 224, 248, 274, 274, 287, 301, 320, 340, 351, 361
Offset: 0

Views

Author

Gus Wiseman, Dec 07 2022

Keywords

Examples

			The a(1) = 1 through a(11) = 7 partitions:
  (1)  (2)  (3)   (4)   (5)   (6)   (7)    (8)    (9)    (A)    (B)
            (21)  (31)  (41)  (42)  (43)   (62)   (54)   (82)   (74)
                              (51)  (61)   (71)   (63)   (91)   (65)
                                    (421)  (431)  (81)   (451)  (83)
                                                  (621)  (631)  (92)
                                                                (A1)
                                                                (821)

Links

Crossrefs

The weakly decreasing version is A358909 (complement A358910).
The version not counting multiplicity is A358903, weakly decreasing A358902.
For equal numbers of prime factors we have A319169, compositions A358911.
A001222 counts prime factors, distinct A001221.
A063834 counts twice-partitions.
A358836 counts multiset partitions with all distinct block sizes.
Cf. A056239, A129519, A141199, A218482, A300335, A319071, A320324, A358335, A358831, A358908.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@PrimeOmega/@#&]],{n,0,60}]

Extensions

a(61) and beyond from Lucas A. Brown, Dec 14 2022

A358905 Number of sequences of integer partitions with total sum n that are rectangular, meaning all lengths are equal.

Original entry on oeis.org

1, 1, 3, 6, 13, 24, 49, 91, 179, 341, 664, 1280, 2503, 4872, 9557, 18750, 36927, 72800, 143880, 284660, 564093, 1118911, 2221834, 4415417, 8781591, 17476099, 34799199, 69327512, 138176461, 275503854, 549502119, 1096327380, 2187894634, 4367310138, 8719509111
Offset: 0

Views

Author

Gus Wiseman, Dec 07 2022

Keywords

Examples

			The a(0) = 1 through a(4) = 13 sequences:
  ()  ((1))  ((2))     ((3))        ((4))
             ((11))    ((21))       ((22))
             ((1)(1))  ((111))      ((31))
                       ((1)(2))     ((211))
                       ((2)(1))     ((1111))
                       ((1)(1)(1))  ((1)(3))
                                    ((2)(2))
                                    ((3)(1))
                                    ((11)(11))
                                    ((1)(1)(2))
                                    ((1)(2)(1))
                                    ((2)(1)(1))
                                    ((1)(1)(1)(1))

Links

Crossrefs

The case of set partitions is A038041.
The version for weakly decreasing lengths is A141199, strictly A358836.
For equal sums instead of lengths we have A279787.
The case of twice-partitions is A306319, distinct A358830.
The unordered version is A319066.
The case of plane partitions is A323429.
The case of constant sums also is A358833.
A055887 counts sequences of partitions with total sum n.
A281145 counts same-trees.
A319169 counts partitions with constant Omega, ranked by A320324.
A358911 counts compositions with constant Omega, distinct A358912.
Cf. A000041, A000219, A001970, A063834, A218482, A305551, A358835.

Programs

  • Mathematica
    ptnseq[n_]:=Join@@Table[Tuples[IntegerPartitions/@comp],{comp,Join@@Permutations/@IntegerPartitions[n]}];
Table[Length[Select[ptnseq[n],SameQ@@Length/@#&]],{n,0,10}]
  • PARI
    P(n,y) = {1/prod(k=1, n, 1 - y*x^k + O(x*x^n))}
seq(n) = {my(g=P(n,y)); Vec(1 + sum(k=1, n, 1/(1 - polcoef(g, k, y)) - 1))} \\ Andrew Howroyd, Dec 31 2022

Formula

G.f.: 1 + Sum_{k>=1} (1/(1 - [y^k]P(x,y)) - 1) where P(x,y) = 1/Product_{k>=1} (1 - y*x^k). - Andrew Howroyd, Dec 31 2022

Extensions

Terms a(16) and beyond from Andrew Howroyd, Dec 31 2022

A358903 Number of integer partitions of n whose parts have all different numbers of distinct prime factors (A001221).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 5, 7, 8, 7, 9, 10, 10, 10, 9, 11, 15, 14, 13, 15, 14, 14, 17, 16, 17, 17, 16, 16, 17, 17, 21, 26, 24, 23, 25, 27, 29, 32, 31, 29, 36, 36, 35, 37, 37, 42, 49, 45, 44, 50, 49, 50, 58, 55, 55, 58, 56, 58, 66, 62, 65, 75
Offset: 0

Views

Author

Gus Wiseman, Dec 07 2022

Keywords

Examples

			The a(15) = 8 partitions are: (15), (14,1), (12,3), (12,2,1), (10,5), (10,4,1), (6,9), (8,6,1).

Links

Crossrefs

Counting prime factors with multiplicity gives A358901.
The weakly decreasing version is A358902, with multiplicity A358335.
A001222 counts prime factors, distinct A001221.
A116608 counts partitions by sum and number of distinct parts.
A358836 counts multiset partitions with all distinct block sizes.
Cf. A046660, A071625, A129519, A141199, A319169, A358831, A358909, A358911.

Programs

  • Maple
    p:= proc(n) option remember; nops(ifactors(n)[2]) end:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<0, 0,
      add((t-> `if`(t b(n$2):
seq(a(n), n=0..68);  # Alois P. Heinz, Feb 14 2024
  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@PrimeNu/@#&]],{n,0,30}]

Extensions

a(56) and beyond from Lucas A. Brown, Dec 14 2022

A374704 Number of ways to choose an integer partition of each part of an integer composition of n (A055887) such that the minima are identical.

Original entry on oeis.org

1, 1, 3, 6, 15, 31, 77, 171, 410, 957, 2275, 5370, 12795, 30366, 72307, 172071, 409875, 976155, 2325804, 5541230, 13204161, 31464226, 74980838, 178684715, 425830008, 1014816979, 2418489344, 5763712776, 13736075563, 32735874251, 78016456122, 185929792353, 443110675075
Offset: 0

Views

Author

Gus Wiseman, Aug 04 2024

Keywords

Examples

			The a(0) = 1 through a(4) = 15 ways:
  ()  ((1))  ((2))      ((3))          ((4))
             ((1,1))    ((1,2))        ((1,3))
             ((1),(1))  ((1,1,1))      ((2,2))
                        ((1),(1,1))    ((1,1,2))
                        ((1,1),(1))    ((2),(2))
                        ((1),(1),(1))  ((1,1,1,1))
                                       ((1),(1,2))
                                       ((1,2),(1))
                                       ((1),(1,1,1))
                                       ((1,1),(1,1))
                                       ((1,1,1),(1))
                                       ((1),(1),(1,1))
                                       ((1),(1,1),(1))
                                       ((1,1),(1),(1))
                                       ((1),(1),(1),(1))

Links

Crossrefs

A variation for weakly increasing lengths is A141199.
For identical sums instead of minima we have A279787.
The case of reversed twice-partitions is A306319, distinct A358830.
For maxima instead of minima, or for unreversed partitions, we have A358905.
The strict case is A374686 (ranks A374685), maxima A374760 (ranks A374759).
A003242 counts anti-run compositions, ranks A333489.
A011782 counts compositions.
A238130, A238279, A333755 count compositions by number of runs.
A274174 counts contiguous compositions, ranks A374249.
A055887 counts sequences of partitions with total sum n.
A281145 counts same-trees.
A319169 counts partitions with constant Omega, ranked by A320324.
A358911 counts compositions with constant Omega, distinct A358912.
Cf. A000041, A063834, A106356, A189076, A238343, A304969, A305551, A319066, A323429, A333213, A358833, A358835.

Programs

  • Mathematica
    Table[Length[Select[Join@@Table[Tuples[IntegerPartitions/@y], {y,Join@@Permutations/@IntegerPartitions[n]}],SameQ@@Min/@#&]],{n,0,15}]
  • PARI
    seq(n) = Vec(1 + sum(k=1, n, -1 + 1/(1 - x^k/prod(j=k, n-k, 1 - x^j, 1 + O(x^(n-k+1)))))) \\ Andrew Howroyd, Dec 29 2024

Formula

G.f.: 1 + Sum_{k>=1} (-1 + 1/(1 - x^k/Product_{j>=k} (1 - x^j))). - Andrew Howroyd, Dec 29 2024

Extensions

a(16) onwards from Andrew Howroyd, Dec 29 2024

A358335 Number of integer compositions of n whose parts have weakly decreasing numbers of prime factors (with multiplicity).

Original entry on oeis.org

1, 1, 2, 3, 5, 8, 12, 19, 29, 44, 68, 100, 153, 227, 342, 509, 759, 1129, 1678, 2492, 3699, 5477, 8121, 12015, 17795, 26313, 38924, 57541, 85065, 125712, 185758, 274431, 405420, 598815, 884465, 1306165, 1928943, 2848360, 4205979, 6210289, 9169540
Offset: 0

Views

Author

Gus Wiseman, Dec 05 2022

Keywords

Examples

			The a(0) = 1 through a(6) = 12 compositions:
  ()  (1)  (2)   (3)    (4)     (5)      (6)
           (11)  (21)   (22)    (23)     (33)
                 (111)  (31)    (32)     (42)
                        (211)   (41)     (51)
                        (1111)  (221)    (222)
                                (311)    (231)
                                (2111)   (321)
                                (11111)  (411)
                                         (2211)
                                         (3111)
                                         (21111)
                                         (111111)

Links

Crossrefs

For lengths of partitions see A141199, compositions A218482.
The strictly decreasing case is A358901.
The version not counting multiplicity is A358902, strict A358903.
The case of partitions is A358909, complement A358910.
The case of equality is A358911, partitions A319169.
A001222 counts prime factors, distinct A001221.
A011782 counts compositions.
A063834 counts twice-partitions.
Cf. A056239, A300335, A319071, A320324, A358831, A358904, A358908.

Programs

  • Mathematica
    Table[Length[Select[Join @@ Permutations/@IntegerPartitions[n],GreaterEqual@@PrimeOmega/@#&]],{n,0,10}]

Extensions

a(21) and beyond from Lucas A. Brown, Dec 15 2022

A358902 Number of integer compositions of n whose parts have weakly decreasing numbers of distinct prime factors (A001221).

Original entry on oeis.org

1, 1, 2, 3, 5, 8, 13, 21, 33, 53, 84, 134, 213, 338, 536, 850, 1349, 2136, 3389, 5367, 8509, 13480, 21362, 33843, 53624, 84957, 134600, 213251, 337850, 535251, 847987, 1343440, 2128372, 3371895, 5341977, 8463051, 13407689, 21241181, 33651507, 53312538, 84460690
Offset: 0

Views

Author

Gus Wiseman, Dec 07 2022

Keywords

Examples

			The a(0) = 1 through a(6) = 13 compositions:
  ()  (1)  (2)   (3)    (4)     (5)      (6)
           (11)  (21)   (22)    (23)     (24)
                 (111)  (31)    (32)     (33)
                        (211)   (41)     (42)
                        (1111)  (221)    (51)
                                (311)    (222)
                                (2111)   (231)
                                (11111)  (321)
                                         (411)
                                         (2211)
                                         (3111)
                                         (21111)
                                         (111111)

Links

Crossrefs

For lengths of partitions see A141199, compositions A218482.
The strictly decreasing case is A358903.
A001222 counts prime factors, distinct A001221.
A011782 counts compositions.
A116608 counts partitions by sum and number of distinct parts.
A334028 counts distinct parts in standard compositions.
A358836 counts multiset partitions with all distinct block sizes.
Cf. A046660, A056239, A071625, A129519, A300335, A358831, A358908, A358911.

Programs

  • Maple
    p:= proc(n) option remember; nops(ifactors(n)[2]) end:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<0, 0,
      add((t-> `if`(t<=i, b(n-j, t), 0))(p(j)), j=1..n)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..40);  # Alois P. Heinz, Feb 14 2024
  • Mathematica
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],GreaterEqual@@PrimeNu/@#&]],{n,0,10}]

Extensions

a(21) and beyond from Lucas A. Brown, Dec 15 2022

A358909 Number of integer partitions of n whose parts have weakly decreasing numbers of prime factors (A001222).

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 29, 41, 53, 73, 93, 124, 157, 206, 256, 329, 406, 514, 628, 784, 949, 1174, 1411, 1725, 2061, 2500, 2966, 3570, 4217, 5039, 5919, 7027, 8219, 9706, 11301, 13268, 15394, 17995, 20792, 24195, 27863, 32288, 37061, 42779, 48950, 56306
Offset: 0

Views

Author

Gus Wiseman, Dec 09 2022

Keywords

Comments

First differs from A000041 at a(9) = 29, A000041(9) = 30, the difference coming from the partition (5,4).

Crossrefs

For sequences of partitions see A141199, compositions A218482.
The case of equality is A319169, for compositions A358911.
The case of compositions is A358335, strictly decreasing A358901.
The complement is counted by A358910.
A001222 counts prime factors, distinct A001221.
A011782 counts compositions.
A063834 counts twice-partitions.
Cf. A056239, A300335, A320324, A358831, A358903, A358908.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],GreaterEqual@@PrimeOmega/@#&]],{n,0,30}]

A358910 Number of integer partitions of n whose parts do not have weakly decreasing numbers of prime factors (A001222).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 4, 8, 11, 19, 25, 41, 56, 84, 113, 164, 218, 306, 401, 547, 711, 949, 1218, 1599, 2034, 2625, 3310, 4224, 5283, 6664, 8271, 10336, 12747, 15791, 19343, 23791, 28979, 35398, 42887, 52073, 62779, 75804, 90967, 109291, 130605
Offset: 0

Views

Author

Gus Wiseman, Dec 09 2022

Keywords

Examples

			The a(9) = 1 through a(14) = 11 partitions:
  (54)  (541)  (74)    (543)    (76)      (554)
               (542)   (741)    (544)     (743)
               (5411)  (5421)   (742)     (761)
                       (54111)  (5422)    (5432)
                                (5431)    (5441)
                                (7411)    (7421)
                                (54211)   (54221)
                                (541111)  (54311)
                                          (74111)
                                          (542111)
                                          (5411111)

Crossrefs

For sequences of partitions see A141199, compositions A218482.
The case of equality is A319169, for compositions A358911.
The complement is counted by A358909.
A001222 counts prime factors, distinct A001221.
A063834 counts twice-partitions.
Cf. A056239, A300335, A320324, A358831, A358902, A358903, A358908.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],!GreaterEqual@@PrimeOmega/@#&]],{n,0,30}]
Showing 1-8 of 8 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.