A318762 -id:A318762 - cp's OEIS frontend

A323307 Number of ways to fill a matrix with the parts of a multiset whose multiplicities are the prime indices of n.

1, 1, 2, 4, 2, 6, 3, 12, 18, 12, 2, 36, 4, 10, 20, 72, 2, 60, 4, 40, 60, 24, 3, 120, 80, 14, 360, 120, 4, 240, 2, 240, 42, 32, 70, 720, 6, 27, 112, 480, 2, 210, 4, 84, 420, 40, 4, 1440, 280, 280, 108, 224, 5, 1260, 224, 420, 180, 22, 2, 840, 6, 72, 1680, 2880

Offset: 1

Gus Wiseman, Jan 13 2019

nonn

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}.

			The a(22) = 24 matrices:
  [111112] [111121] [111211] [112111] [121111] [211111]
.
  [111] [111] [111] [112] [121] [211]
  [112] [121] [211] [111] [111] [111]
.
  [11] [11] [11] [11] [12] [21]
  [11] [11] [12] [21] [11] [11]
  [12] [21] [11] [11] [11] [11]
.
  [1] [1] [1] [1] [1] [2]
  [1] [1] [1] [1] [2] [1]
  [1] [1] [1] [2] [1] [1]
  [1] [1] [2] [1] [1] [1]
  [1] [2] [1] [1] [1] [1]
  [2] [1] [1] [1] [1] [1]

Gus Wiseman, The a(27) = 360 matrix-arrangements of (1,1,2,2,3,3).

Cf. A007716, A056239, A112798, A120733, A181821, A305936, A318283, A318284, A323295, A323300, A323351.

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]]}]];
ptnmats[n_]:=Union@@Permutations/@Select[Union@@(Tuples[Permutations/@#]&/@Map[primeMS,facs[n],{2}]),SameQ@@Length/@#&];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Array[Length[ptnmats[Times@@Prime/@nrmptn[#]]]&,30]

a(n) = A318762(n) * A000005(A056239(n)).

A332672 Number of non-unimodal permutations of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 2, 3, 0, 0, 6, 0, 0, 6, 16, 0, 21, 0, 12, 10, 0, 0, 48, 16, 0, 81, 20, 0, 48, 0, 104, 15, 0, 30, 162, 0, 0, 21, 104, 0, 90, 0, 30, 198, 0, 0, 336, 65, 124, 28, 42, 0, 603, 50, 190, 36, 0, 0, 396, 0, 0, 405, 688, 77, 150, 0, 56, 45, 260, 0

Offset: 1

Gus Wiseman, Feb 23 2020

nonn

This multiset 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 sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(n) permutations for n = 8, 9, 12, 15, 16:
  213   1212   1213   11212   1324
  312   2112   1312   12112   1423
        2121   2113   12121   2134
               2131   21112   2143
               3112   21121   2314
               3121   21211   2413
                              3124
                              3142
                              3214
                              3241
                              3412
                              4123
                              4132
                              4213
                              4231
                              4312

MathWorld, Unimodal Sequence

Positions of zeros are one and A001751.
Support is A264828 without one.
Dominated by A318762.
The complement is counted by A332294.
A less interesting version is A332671.
The opposite version is A332742.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences are A328509.
Heinz numbers of partitions with non-unimodal run-lengths are A332282.
Compositions whose negation is not unimodal are A332669.
Cf. A007052, A008480, A056239, A112798, A124010, A181819, A181821, A332281, A332287, A332294, A332642, A332741.

nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[Permutations[nrmptn[n]],!unimodQ[#]&]],{n,30}]

a(n) = A332671(A181821(n)).

a(n) + A332294(n) = A318762(n).

A332741 Number of unimodal negated permutations of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 3, 8, 1, 6, 1, 4, 3, 2, 1, 8, 4, 2, 9, 4, 1, 6, 1, 16, 3, 2, 4, 12, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 16, 5, 8, 3, 4, 1, 18, 4, 8, 3, 2, 1, 12, 1, 2, 9, 32, 4, 6, 1, 4, 3, 8, 1, 24, 1, 2, 12, 4, 5, 6, 1, 16, 27, 2, 1

Offset: 1

Gus Wiseman, Mar 09 2020

nonn

This multiset 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 sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(12) = 4 permutations:
  {1,1,2,3}
  {2,1,1,3}
  {3,1,1,2}
  {3,2,1,1}

Eric Weisstein's World of Mathematics, Unimodal Sequence

Dominated by A318762.
The non-negated version is A332294.
The complement is counted by A332742.
A less interesting version is A333145.
Unimodal compositions are A001523.
Unimodal normal sequences are A007052.
Numbers with non-unimodal negated prime signature are A332642.
Partitions whose 0-appended first differences are unimodal are A332283.
Compositions whose negation is unimodal are A332578.
Partitions with unimodal negated run-lengths are A332638.
Cf. A056239, A112798, A115981, A124010, A181819, A181821, A304660, A332280, A332288, A332639, A332669, A332672.

nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[Permutations[nrmptn[n]],unimodQ[-#]&]],{n,30}]

a(n) + A332742(n) = A318762(n).

A376367 Sorted multinomial coefficients greater than 1, including duplicates.

Original entry on oeis.org

2, 3, 4, 5, 6, 6, 6, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 19, 20, 20, 20, 21, 21, 22, 23, 24, 24, 25, 26, 27, 28, 28, 29, 30, 30, 30, 31, 32, 33, 34, 35, 35, 36, 36, 37, 38, 39, 40, 41, 42, 42, 43, 44, 45, 45, 46, 47, 48, 49, 50, 51, 52, 53

Offset: 1

Pontus von Brömssen, Sep 22 2024

nonn

Sorted terms of A036038, A050382, A078760, or A318762, excluding 1 (which appears infinitely often).

The number k appears A376369(k) times.

Pontus von Brömssen, Table of n, a(n) for n = 1..10000

Cf. A036038, A050382, A078760, A318762, A376369, A376379.

a(n) = A318762(A376379(n)).

A318849 Number of orderless tree-partitions of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

1, 1, 2, 2, 4, 6, 11, 8, 27, 20, 30, 38, 96, 74, 114, 58, 308, 234, 1052, 176, 509, 278, 3648, 374, 600, 1076, 1760, 814, 13003, 1306, 47006, 612, 2226, 4200, 3094, 2914, 172605, 16588, 9814, 2168, 640662, 6998, 2402388, 3698, 11496, 65936, 9082538, 4914, 17996

Offset: 1

Gus Wiseman, Sep 04 2018

nonn

This multiset 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 tree-partition of m is either m itself or a multiset of tree-partitions, one of each part of a multiset partition of m with at least two parts.

			The a(7) = 11 orderless tree-partitions of {1,1,1,1}:
  (1111)
  ((1)(111))
  ((11)(11))
  ((1)(1)(11))
  ((1)((1)(11)))
  ((11)((1)(1)))
  ((1)(1)(1)(1))
  ((1)((1)(1)(1)))
  ((1)(1)((1)(1)))
  ((1)((1)((1)(1))))
  (((1)(1))((1)(1)))

Cf. A000311, A001055, A196545, A292504, A292505, A305936, A316655, A318762, A318812, A318813, A318847.

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}]]]]];
olmsptrees[m_]:=Prepend[Union@@Table[Sort/@Tuples[olmsptrees/@p],{p,Select[mps[m],Length[#]>1&]}],m];
Table[Length[olmsptrees[nrmptn[n]]],{n,15}]

a(n) = A292504(A181821(n)).
a(prime(n)) = A141268(n).
a(2^n) = A005804(n).

More terms from Jinyuan Wang, Jun 26 2020

A318846 Number of balanced reduced multisystems whose atoms cover an initial interval of positive integers with multiplicities equal to the prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 6, 4, 15, 11, 20, 21, 90, 51, 80, 32, 468, 166, 2910, 124, 521, 277, 20644, 266, 621, 1761, 1866, 841, 165874, 1374, 1484344, 436, 3797, 12741, 5383, 3108, 14653890, 103783, 31323, 2294, 158136988, 12419, 1852077284, 6382, 20786, 939131, 23394406084

Offset: 1

Gus Wiseman, Sep 04 2018

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. A multiset whose multiplicities are the prime indices of n (such as 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 balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.

			The a(12) = 21 multisystems on {1,1,2,3} (commas elided):
  {1123}  {{1}{123}}  {{1}{1}{23}}  {{{1}}{{1}{23}}}
          {{2}{113}}  {{1}{2}{13}}  {{{23}}{{1}{1}}}
          {{3}{112}}  {{1}{3}{12}}  {{{1}}{{2}{13}}}
          {{11}{23}}  {{2}{3}{11}}  {{{2}}{{1}{13}}}
          {{12}{13}}                {{{13}}{{1}{2}}}
                                    {{{1}}{{3}{12}}}
                                    {{{3}}{{1}{12}}}
                                    {{{12}}{{1}{3}}}
                                    {{{2}}{{3}{11}}}
                                    {{{3}}{{2}{11}}}
                                    {{{11}}{{2}{3}}}

Row sums of A330727.
Cf. A001055, A002846, A005121, A181821, A213427, A281118, A281119, A305936, A318762, A318812, A318813.
Cf. A318847, A318848, A318849.

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}]]]]];
tmsp[m_]:=Prepend[Join@@Table[tmsp[c],{c,Select[mps[m],1

a(n) = A318812(A181821(n)).
a(prime(n)) = A318813(n).
a(2^n) = A005121(n).

Terminology corrected by Gus Wiseman, Jan 04 2020

More terms from Jinyuan Wang, Jun 26 2020

A318848 Number of complete tree-partitions of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 5, 4, 12, 9, 12, 17, 34, 29, 44, 26, 92, 90, 277, 68, 171, 93, 806, 144, 197, 309, 581, 269, 2500, 428, 7578, 236, 631, 1025, 869, 954, 24198, 3463, 2402, 712, 75370, 1957, 243800, 1040, 3200, 11705, 776494, 1612, 4349, 2358, 8862, 3993, 2545777

Offset: 1

Gus Wiseman, Sep 04 2018

nonn

This multiset 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 tree-partition of m is either m itself or a sequence of tree-partitions, one of each part of a multiset partition of m with at least two parts. A tree-partition is complete if the leaves are all multisets of length 1.

			The a(12) = 17 complete tree-partitions of {1,1,2,3} with the leaves (x) replaced with just x:
  (1(1(23)))
  (1(2(13)))
  (1(3(12)))
  (2(1(13)))
  (2(3(11)))
  (3(1(12)))
  (3(2(11)))
  ((11)(23))
  ((12)(13))
  (1(123))
  (2(113))
  (3(112))
  (11(23))
  (12(13))
  (13(12))
  (23(11))
  (1123)

Cf. A000311, A001055, A196545, A281118, A281119, A305936, A318762, A318812, A318813, A318846, A318847, A318849.

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}]]]]];
allmsptrees[m_]:=Prepend[Join@@Table[Tuples[allmsptrees/@p],{p,Select[mps[m],Length[#]>1&]}],m];
Table[Length[Select[allmsptrees[nrmptn[n]],FreeQ[#,{?AtomQ,_}]&]],{n,20}]

a(n) = A281119(A181821(n)).
a(prime(n)) = A196545(n)
a(2^n) = A000311(n).

More terms from Jinyuan Wang, Jun 26 2020

A323525 Number of ways to arrange the parts of a multiset whose multiplicities are the prime indices of n into a square matrix.

Original entry on oeis.org

1, 1, 0, 0, 0, 0, 1, 0, 6, 4, 0, 12, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 36, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 84, 0, 0, 72, 0, 0, 0, 0, 0, 0, 0, 0, 126, 252, 0, 0, 0, 0, 0, 0

Offset: 1

Gus Wiseman, Jan 17 2019

nonn

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}.

			The a(9) = 6 matrices:
  [1 1] [1 2] [1 2] [2 1] [2 1] [2 2]
  [2 2] [1 2] [2 1] [1 2] [2 1] [1 1]
The a(38) = 9 matrices:
  [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 2] [1 2 1] [2 1 1]
  [1 1 1] [1 1 1] [1 1 1] [1 1 2] [1 2 1] [2 1 1] [1 1 1] [1 1 1] [1 1 1]
  [1 1 2] [1 2 1] [2 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1]

The positions of 0's are numbers whose sum of prime indices is not a perfect square (A323527).
The positions of 1's are primes indexed by squares (A323526).
Cf. A008480, A026478, A056239, A103198, A112798, A120732, A318284, A318762, A323519, A323528, A323531.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,Reverse[primeMS[n]]];
Table[If[IntegerQ[Sqrt[Total[primeMS[n]]]],Length[Permutations[nrmptn[n]]],0],{n,100}]

If A056239(n) is a perfect square, a(n) = A318762(n). Otherwise, a(n) = 0.

A309004 The number of numbers with the same prime signature and set of distinct prime factors as n (including n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1

Offset: 1

Amiram Eldar, Jul 22 2019

nonn

The number of permutations of the exponents in the prime signature of n.

The number of terms in the n-th row of A111470.

			a(12) = a(18) = 2 since 12 = 2^2 * 3 and 18 = 3^2 * 2 have the same prime signature, (2, 1), and the same set of distinct prime factors, {2, 3}.
a(60) = a(90) = a(150) = 3 since 60 = 2^2 * 3 * 5, 90 = 3^2 * 2 * 5, and 150 = 5^2 * 2 * 3 have the same prime signature, (2, 1, 1), and the same set of distinct prime factors, {2, 3, 5}.

Antti Karttunen, Table of n, a(n) for n = 1..75600
Index entries for sequences computed from exponents in factorization of n

Cf. A000142, A006939, A008480, A072774, A088860, A111470, A181819, A309308, A309309, A318762.

a[n_] := Multinomial @@ Tally[FactorInteger[n][[;;,2]]][[;;,2]]; Array[a, 100]

A008480(n) = { my(es=factor(n)[, 2], s=vecsum(es)); s!/prod(i=1, #es, es[i]!); };
A181819(n) = factorback(apply(e->prime(e),(factor(n)[,2])));
A309004(n) = A008480(A181819(n)); \\ Antti Karttunen, Sep 27 2019

a(n) = 1 if and only if n is a power of a squarefree number (A072774).
a(A088860(k)) = k.
a(A006939(k)) = A000142(k) = k!.
a(n) = A008480(A181819(n)). - Antti Karttunen, Sep 27 2019

More terms from Antti Karttunen, Sep 27 2019

A318810 Number of necklace permutations of a multiset whose multiplicities are the prime indices of n > 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 1, 1, 2, 6, 1, 6, 1, 4, 3, 1, 1, 12, 4, 1, 16, 5, 1, 10, 1, 24, 3, 1, 5, 30, 1, 1, 4, 20, 1, 15, 1, 6, 30, 1, 1, 60, 10, 20, 4, 7, 1, 90, 7, 30, 5, 1, 1, 60, 1, 1, 54, 120, 10, 21, 1, 8, 5, 35, 1, 180, 1, 1, 70, 9, 14, 28, 1

Offset: 1

Gus Wiseman, Sep 04 2018

nonn

This multiset 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 necklace is a finite sequence that is minimal among its cyclic permutations.
a(1) = 1 by convention.

			The a(21) = 3 necklace permutations of {1,1,1,1,2,2} are: (111122), (111212), (112112). Only the first two are Lyndon words, the third being periodic.

Andrew Howroyd, Table of n, a(n) for n = 1..1000

Cf. A000670, A008480, A019536, A056239, A060223, A112798, A298941, A305936, A318762, A318808, A318809.

nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
neckQ[q_]:=Array[OrderedQ[{q,RotateRight[q,#]}]&,Length[q]-1,1,And];
Table[Length[Select[Permutations[nrmptn[n]],neckQ]],{n,2,100}]

sig(n)={my(f=factor(n)); concat(vector(#f~, i, vector(f[i,2], j, primepi(f[i,1]))))}
count(sig)={my(n=vecsum(sig)); sumdiv(gcd(sig), d, eulerphi(d)*(n/d)!/prod(i=1, #sig, (sig[i]/d)!))/n}
a(n)={if(n==1, 1, count(sig(n)))} \\ Andrew Howroyd, Dec 08 2018

a(p) = 1 for prime p. - Andrew Howroyd, Dec 08 2018

a(1) inserted by Andrew Howroyd, Dec 08 2018

cp's OEIS Frontend

A323307 Number of ways to fill a matrix with the parts of a multiset whose multiplicities are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A332672 Number of non-unimodal permutations of a multiset whose multiplicities are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A332741 Number of unimodal negated permutations of a multiset whose multiplicities are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A376367 Sorted multinomial coefficients greater than 1, including duplicates.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A318849 Number of orderless tree-partitions of a multiset whose multiplicities are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A318846 Number of balanced reduced multisystems whose atoms cover an initial interval of positive integers with multiplicities equal to the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A318848 Number of complete tree-partitions of a multiset whose multiplicities are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A323525 Number of ways to arrange the parts of a multiset whose multiplicities are the prime indices of n into a square matrix.

Views

Author

Keywords

Comments