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.

A322527 Number of integer partitions of n whose product of parts is a power of a squarefree number (A072774).

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 13, 18, 21, 31, 34, 45, 51, 63, 72, 88, 97, 120, 128, 158, 174, 201, 222, 264, 287, 333, 359, 416, 441, 518, 557, 631, 684, 770, 833, 954, 1017, 1141, 1222, 1378, 1475, 1643, 1755, 1939, 2097, 2327, 2471, 2758, 2928, 3233, 3470, 3813, 4085
Offset: 0

Views

Author

Gus Wiseman, Dec 14 2018

Keywords

Examples

			The a(1) = 1 through a(8) = 18 integer partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (52)       (44)
             (111)  (31)    (41)     (42)      (61)       (53)
                    (211)   (221)    (51)      (331)      (71)
                    (1111)  (311)    (222)     (421)      (422)
                            (2111)   (321)     (511)      (521)
                            (11111)  (411)     (2221)     (611)
                                     (2211)    (3211)     (2222)
                                     (3111)    (4111)     (3311)
                                     (21111)   (22111)    (4211)
                                     (111111)  (31111)    (5111)
                                               (211111)   (22211)
                                               (1111111)  (32111)
                                                          (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)
Missing from the list for n = 7 through 9:
  (43)   (62)    (54)
  (322)  (332)   (63)
         (431)   (432)
         (3221)  (522)
                 (621)
                 (3222)
                 (3321)
                 (4311)
                 (32211)
		

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],SameQ@@Last/@FactorInteger[Times@@#]&]],{n,30}]

A322530 Number of integer partitions of n with no 1's whose product of parts is a squarefree number.

Original entry on oeis.org

1, 0, 1, 1, 0, 2, 1, 2, 1, 1, 3, 2, 2, 4, 3, 3, 3, 6, 5, 5, 5, 6, 8, 8, 9, 8, 11, 8, 12, 13, 16, 14, 13, 16, 21, 18, 21, 25, 22, 24, 27, 35, 33, 33, 32, 37, 42, 47, 48, 48, 52, 51, 59, 70, 68, 65, 69, 80, 87, 90, 103, 100, 96, 103, 123, 128, 135, 136, 132, 153
Offset: 0

Views

Author

Gus Wiseman, Dec 14 2018

Keywords

Comments

Such a partition must be strict and its parts must also be squarefree.

Examples

			The a(26) = 11 integer partitions:
  (26),
  (15,11), (19,7), (21,5), (23,3),
  (13,7,6), (13,10,3), (13,11,2), (17,7,2), (19,5,2),
  (11,7,5,3).
		

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],!MemberQ[#,1]&&SquareFreeQ[Times@@#]&]],{n,30}]

A322529 Number of integer partitions of n whose parts all have the same number of prime factors (counted with or without multiplicity) and whose product of parts is a squarefree number.

Original entry on oeis.org

1, 1, 2, 2, 1, 3, 2, 3, 2, 2, 4, 2, 3, 3, 4, 4, 4, 3, 5, 4, 5, 6, 6, 6, 6, 6, 8, 6, 7, 9, 8, 11, 8, 11, 11, 11, 12, 13, 13, 15, 13, 17, 17, 18, 18, 17, 20, 22, 21, 24, 24, 24, 26, 29, 28, 33, 30, 35, 34, 38, 38, 45, 42, 43, 45, 48, 52, 54, 55, 59, 59, 65, 65, 72, 73
Offset: 0

Views

Author

Gus Wiseman, Dec 14 2018

Keywords

Comments

Such a partition must be strict (unless it is all 1's) and its parts must also be squarefree.

Examples

			The a(30) = 8 integer partitions:
  (30),
  (17,13),(19,11),(23,7),
  (17,11,2),(23,5,2),
  (13,7,5,3,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,1).
		

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],And[SameQ@@PrimeOmega/@#,SquareFreeQ[Times@@#]]&]],{n,30}]

Extensions

a(51)-a(69) from Jinyuan Wang, Jun 27 2020
a(70) onwards from Lucas A. Brown, Aug 17 2024

A322531 Heinz numbers of integer partitions whose parts all have the same number of prime factors (counted with or without multiplicity) and whose product of parts is a squarefree number.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 11, 13, 15, 16, 17, 29, 31, 32, 33, 41, 43, 47, 51, 55, 59, 64, 67, 73, 79, 83, 85, 93, 101, 109, 113, 123, 127, 128, 137, 139, 149, 155, 157, 163, 165, 167, 177, 179, 181, 187, 191, 199, 201, 205, 211, 233, 241, 249, 255, 256, 257, 269, 271
Offset: 1

Views

Author

Gus Wiseman, Dec 14 2018

Keywords

Comments

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
All entries are themselves squarefree numbers (except the powers of 2).
The first odd term not in this sequence but in A302521 is 141, which is the MM-number (see A302242) of {{1},{2,3}}.

Examples

			The sequence of all integer partitions whose parts all have the same number of prime factors and whose product of parts is a squarefree number begins: (), (1), (2), (1,1), (3), (1,1,1), (5), (6), (3,2), (1,1,1,1), (7), (10), (11), (1,1,1,1,1), (5,2), (13), (14), (15), (7,2), (5,3), (17), (1,1,1,1,1,1).
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],And[SameQ@@PrimeOmega/@primeMS[#],SquareFreeQ[Times@@primeMS[#]]]&]
Showing 1-4 of 4 results.