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.

Previous Showing 51-53 of 53 results.

A324325 Number of non-crossing multiset partitions of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 5, 5, 9, 7, 7, 11, 11, 12, 16, 14, 15, 26, 22, 21, 29, 19, 30, 33, 31, 30, 66, 38, 42, 52, 56, 42, 47, 45, 57, 82, 77, 67, 77, 67, 101, 98, 135, 64, 137, 97, 176, 104, 109, 109, 118, 105, 231, 213, 97, 127, 181, 139, 297, 173, 385, 195, 269
Offset: 1

Views

Author

Gus Wiseman, Feb 22 2019

Keywords

Comments

This multiset (row n of A305936) is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.
A multiset partition is crossing if it contains two blocks of the form {{...x...y...},{...z...t...}} where x < z < y < t or z < x < t < y.

Examples

			The a(16) = 14 non-crossing multiset partitions of the multiset {1,2,3,4}:
  {{1,2,3,4}}
  {{1},{2,3,4}}
  {{2},{1,3,4}}
  {{3},{1,2,4}}
  {{4},{1,2,3}}
  {{1,2},{3,4}}
  {{1,4},{2,3}}
  {{1},{2},{3,4}}
  {{1},{3},{2,4}}
  {{1},{4},{2,3}}
  {{2},{3},{1,4}}
  {{2},{4},{1,3}}
  {{3},{1,2},{4}}
  {{1},{2},{3},{4}}
Missing from this list is {{1,3},{2,4}}.

Crossrefs

Cf. A000108, A001055, A001970, A016098, A054726, A099947, A181821, A305936, A306438, A318284, A318285.
Cf. A324167, A324168, A324169, A324170, A324171, A324324, A324326.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
nonXQ[stn_]:=!MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x

Formula

a(n) + A324326(n) = A318284(n).

A322076 Number of set multipartitions (multisets of sets) with no singletons, of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 4, 0, 1, 0, 0, 0, 0, 0, 3, 1, 0, 2, 0, 0, 1, 0, 11, 0, 0, 0, 5, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 13, 1, 1, 0, 0, 0, 7, 0, 0, 0, 0, 0, 3, 0, 0, 1, 41, 0, 0, 0, 0, 0, 1, 0, 20, 0, 0, 2, 0, 0, 0, 0, 6, 16, 0, 0, 1, 0
Offset: 1

Views

Author

Gus Wiseman, Nov 25 2018

Keywords

Comments

This multiset (row n of A305936) is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.

Examples

			The a(90) = 7 set multipartitions of {1,1,1,2,2,3,3,4} with no singletons:
  {{1,2},{1,2},{1,3},{3,4}}
  {{1,2},{1,3},{1,3},{2,4}}
  {{1,2},{1,3},{1,4},{2,3}}
  {{1,2},{1,3},{1,2,3,4}}
  {{1,2},{1,2,3},{1,3,4}}
  {{1,3},{1,2,3},{1,2,4}}
  {{1,4},{1,2,3},{1,2,3}}

Crossrefs

Cf. A001055, A007716, A049311, A056156, A116540, A181821, A255906, A304382.
Cf. A318284, A318286, A318360, A318361, A318362, A318369.

Programs

  • Mathematica
    nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
sqnopfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[sqnopfacs[n/d],Min@@#>=d&]],{d,Select[Rest[Divisors[n]],!PrimeQ[#]&&SquareFreeQ[#]&]}]];
Table[Length[sqnopfacs[Times@@Prime/@nrmptn[n]]],{n,30}]

A322077 In the ranked poset of integer partitions ordered by refinement, number of integer partitions coarser (greater) than or equal to the integer partition whose multiplicities are the prime indices of n in weakly decreasing order.

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 5, 5, 8, 6, 7, 9, 11, 10, 12, 13, 15, 18, 22, 15, 19, 14, 30, 24, 22, 21, 40, 23, 42, 29, 56, 36, 27, 29, 34, 47, 77, 41, 39, 40
Offset: 1

Views

Author

Gus Wiseman, Nov 25 2018

Keywords

Comments

This partition (reversed row n of A305936) is generally not the same as the integer partition with Heinz number n. For example, 12 is the Heinz number of (2,1,1), while the integer partition whose multiplicities are (2,1,1) is (3,2,1,1).

Examples

			The list of a(1) = 1 through a(18) = 18 coarser partitions:
  ()  (1)  (2)   (3)   (3)    (4)    (4)     (6)    (6)     (5)     (5)
           (11)  (21)  (21)   (22)   (22)    (33)   (33)    (32)    (32)
                       (111)  (31)   (31)    (42)   (42)    (41)    (41)
                              (211)  (211)   (51)   (51)    (221)   (221)
                                     (1111)  (321)  (222)   (311)   (311)
                                                    (321)   (2111)  (2111)
                                                    (411)           (11111)
                                                    (2211)
.
  (7)     (6)       (6)      (7)      (10)    (7)        (9)
  (43)    (33)      (33)     (43)     (55)    (43)       (54)
  (52)    (42)      (42)     (52)     (64)    (52)       (63)
  (61)    (51)      (51)     (61)     (73)    (61)       (72)
  (322)   (222)     (222)    (322)    (82)    (322)      (81)
  (331)   (321)     (321)    (331)    (91)    (331)      (333)
  (421)   (411)     (411)    (421)    (433)   (421)      (432)
  (511)   (2211)    (2211)   (511)    (442)   (511)      (441)
  (3211)  (3111)    (3111)   (2221)   (532)   (2221)     (522)
          (21111)   (21111)  (3211)   (541)   (3211)     (531)
          (111111)           (4111)   (631)   (4111)     (621)
                             (22111)  (721)   (22111)    (711)
                                      (4321)  (31111)    (3222)
                                              (211111)   (3321)
                                              (1111111)  (4221)
                                                         (4311)
                                                         (5211)
                                                         (32211)

Crossrefs

Cf. A063834, A066723, A213427, A265947, A299201, A300383, A317141, A321468, A321472.

Programs

  • Mathematica
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Table[Length[Union[Sort/@Apply[Plus,mps[nrmptn[n]],{2}]]],{n,20}]
Previous Showing 51-53 of 53 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.