A325362 -id:A325362 - cp's OEIS frontend

A325354 Number of reversed integer partitions of n whose k-th differences are weakly increasing for all k.

1, 1, 2, 3, 5, 6, 10, 11, 15, 19, 24, 25, 36, 37, 43, 54, 63, 64, 80, 81, 100, 113, 122, 123, 151, 166, 178, 195, 217, 218, 269, 270, 295, 316, 332, 372, 424, 425, 447, 472, 547, 550, 616, 617, 659, 750, 777, 782, 862, 885, 995, 1032, 1083, 1090, 1176, 1275

Offset: 0

Gus Wiseman, May 02 2019

nonn

The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (6,3,1) are (-3,-2).
The zeroth differences of a sequence are the sequence itself, while the k-th differences for k > 0 are the differences of the (k-1)-th differences.
The Heinz numbers of these partitions are given by A325400.

			The a(1) = 1 through a(8) = 15 reversed partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (12)   (13)    (14)     (15)      (16)       (17)
             (111)  (22)    (23)     (24)      (25)       (26)
                    (112)   (113)    (33)      (34)       (35)
                    (1111)  (1112)   (114)     (115)      (44)
                            (11111)  (123)     (124)      (116)
                                     (222)     (223)      (125)
                                     (1113)    (1114)     (224)
                                     (11112)   (11113)    (1115)
                                     (111111)  (111112)   (1124)
                                               (1111111)  (2222)
                                                          (11114)
                                                          (111113)
                                                          (1111112)
                                                          (11111111)

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Cf. A007294, A240026, A325353, A325356, A325360, A325362, A325391, A325393, A325394, A325400, A325404, A325406, A325468.

Table[Length[Select[Sort/@IntegerPartitions[n],And@@Table[OrderedQ[Differences[#,k]],{k,0,Length[#]}]&]],{n,0,30}]

A325400 Heinz numbers of reversed integer partitions whose k-th differences are weakly increasing for all k >= 0.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 73, 74

Offset: 1

Gus Wiseman, May 02 2019

nonn

First differs from A109427 in lacking 54.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (6,3,1) are (-3,-2).
The zeroth differences of a sequence are the sequence itself, while the k-th differences for k > 0 are the differences of the (k-1)-th differences.
The enumeration of these partitions by sum is given by A325354.

			Most small numbers are in the sequence. However, the sequence of non-terms together with their prime indices begins:
   18: {1,2,2}
   36: {1,1,2,2}
   50: {1,3,3}
   54: {1,2,2,2}
   60: {1,1,2,3}
   70: {1,3,4}
   72: {1,1,1,2,2}
   75: {2,3,3}
   90: {1,2,2,3}
   98: {1,4,4}
  100: {1,1,3,3}
  108: {1,1,2,2,2}
  120: {1,1,1,2,3}
  126: {1,2,2,4}
  140: {1,1,3,4}
  144: {1,1,1,1,2,2}
  147: {2,4,4}
  150: {1,2,3,3}
  154: {1,4,5}
  162: {1,2,2,2,2}

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Cf. A007294, A056239, A112798, A240026, A325354, A325360, A325362, A325394, A325397, A325398, A325399, A325405, A325467.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],And@@Table[Greater@@Differences[primeptn[#],k],{k,0,PrimeOmega[#]}]&]

A325460 Heinz numbers of integer partitions with strictly increasing differences (with the last part taken to be 0).

Original entry on oeis.org

1, 2, 3, 5, 7, 10, 11, 13, 14, 17, 19, 22, 23, 26, 29, 31, 33, 34, 37, 38, 39, 41, 43, 46, 47, 51, 53, 57, 58, 59, 61, 62, 67, 69, 71, 73, 74, 79, 82, 83, 85, 86, 87, 89, 93, 94, 95, 97, 101, 103, 106, 107, 109, 111, 113, 115, 118, 122, 123, 127, 129, 130, 131

Offset: 1

Gus Wiseman, May 03 2019

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (6,3,1) (with the last part taken to be 0) are (-3,-2,-1).
The enumeration of these partitions by sum is given by A179269.

			The sequence of terms together with their prime indices begins:
    1: {}
    2: {1}
    3: {2}
    5: {3}
    7: {4}
   10: {1,3}
   11: {5}
   13: {6}
   14: {1,4}
   17: {7}
   19: {8}
   22: {1,5}
   23: {9}
   26: {1,6}
   29: {10}
   31: {11}
   33: {2,5}
   34: {1,7}
   37: {12}
   38: {1,8}

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

A subsequence of A005117.

Cf. A007294, A056239, A112798, A179269, A325327, A325362, A325364, A325367, A325388, A325390, A325395, A325398, A325456, A325461.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],Less@@Differences[Append[primeptn[#],0]]&]

A325461 Heinz numbers of integer partitions with strictly decreasing differences (with the last part taken to be 0).

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 9, 11, 13, 15, 17, 19, 23, 25, 29, 31, 35, 37, 41, 43, 47, 49, 53, 55, 59, 61, 67, 71, 73, 75, 77, 79, 83, 89, 91, 97, 101, 103, 107, 109, 113, 119, 121, 127, 131, 137, 139, 143, 149, 151, 157, 163, 167, 169, 173, 179, 181, 187, 191, 193, 197

Offset: 1

Gus Wiseman, May 03 2019

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (6,3,1) (with the last part taken to be 0) are (-3,-2,-1).
The enumeration of these partitions by sum is given by A320510.

			The sequence of terms together with their prime indices begins:
    1: {}
    2: {1}
    3: {2}
    4: {1,1}
    5: {3}
    7: {4}
    9: {2,2}
   11: {5}
   13: {6}
   15: {2,3}
   17: {7}
   19: {8}
   23: {9}
   25: {3,3}
   29: {10}
   31: {11}
   35: {3,4}
   37: {12}
   41: {13}
   43: {14}

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Cf. A056239, A112798, A320510, A325327, A325362, A325364, A325367, A325388, A325390, A325396, A325399, A325407, A325457, A325460.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],Greater@@Differences[Append[primeptn[#],0]]&]

A325392 Number of permutations of the multiset of prime factors of n whose first part is not 2.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 0, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 0, 2, 1, 2, 3, 1, 1, 2, 1, 1, 4, 1, 1, 3, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 1, 2, 1, 1, 6, 1, 1, 3, 0, 2, 4, 1, 1, 2, 4, 1, 4, 1, 1, 3, 1, 2, 4, 1, 1, 1, 1, 1, 6, 2, 1, 2, 1, 1, 9, 2, 1, 2, 1, 2, 1, 1, 2, 3, 3, 1, 4, 1, 1, 6

Offset: 1

Gus Wiseman, May 02 2019

nonn

			The a(90) = 9 permutations of {2,3,3,5} not starting with 2:
  3 2 3 5
  3 2 5 3
  3 3 2 5
  3 3 5 2
  3 5 2 3
  3 5 3 2
  5 2 3 3
  5 3 2 3
  5 3 3 2

Antti Karttunen, Table of n, a(n) for n = 1..20000

Number of times n appears in A325390.

Cf. A008480, A056239, A112798, A325327, A325362, A325364, A325367, A325403 (even bisection), A325407, A325460, A325461.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Permutations[primeMS[n]],#=={}||First[#]>1&]],{n,100}]

A008480(n) = {my(sig=factor(n)[, 2]); vecsum(sig)!/factorback(apply(k->k!, sig))}; \\ From code in A008480
A325392(n) = if(n%2, A008480(n), A008480(n)-A008480(n/2)); \\ Antti Karttunen, Dec 06 2021

If n is odd, a(n) = A008480(n). If n is even, a(n) = A008480(n) - A008480(n/2).

Data section extended up to 105 terms by Antti Karttunen, Dec 06 2021

A359397 Squarefree numbers with weakly decreasing first differences of 0-prepended prime indices.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 11, 13, 15, 17, 19, 21, 23, 29, 30, 31, 35, 37, 41, 43, 47, 53, 55, 59, 61, 65, 67, 71, 73, 77, 79, 83, 89, 91, 97, 101, 103, 105, 107, 109, 113, 119, 127, 131, 133, 137, 139, 143, 149, 151, 157, 163, 167, 173, 179, 181, 187, 191, 193, 197

Offset: 1

Gus Wiseman, Dec 31 2022

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.

			715 has prime indices {3,5,6}, with first differences (2,1), which are weakly decreasing, so 715 is in the sequence.

This is the squarefree case of A325362.
These are the sorted Heinz numbers of rows of A359361.
A005117 lists squarefree numbers.
A112798 lists prime indices, length A001222, sum A056239, reverse A296150.
A355536 lists first differences of prime indices, 0-prepended A287352.
A358136 lists partial sums of prime indices, row sums A318283.
Cf. A000009, A000720, A001221, A253566, A261079, A304818, A358137, A358169.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],SquareFreeQ[#]&&GreaterEqual@@Differences[Prepend[primeMS[#],0]]&]

Intersection of A325362 and A005117.

A325403 Number of permutations of the multiset of prime factors of 2n whose first part is not 2.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 4, 0, 1, 3, 1, 1, 4, 1, 1, 1, 2, 1, 3, 1, 1, 6, 1, 0, 4, 1, 4, 4, 1, 1, 4, 1, 1, 6, 1, 1, 9, 1, 1, 1, 2, 3, 4, 1, 1, 6, 4, 1, 4, 1, 1, 8, 1, 1, 9, 0, 4, 6, 1, 1, 4, 6, 1, 5, 1, 1, 9, 1, 4, 6, 1, 1, 4, 1, 1, 8, 4, 1, 4, 1, 1, 18, 4, 1, 4, 1, 4, 1, 1, 3, 9, 4, 1, 6, 1, 1, 18

Offset: 1

Gus Wiseman, May 02 2019

nonn

			The a(60) = 8 permutations of {2,2,2,3,5} whose first part is not 2:
  3 2 2 2 5
  3 2 2 5 2
  3 2 5 2 2
  3 5 2 2 2
  5 2 2 2 3
  5 2 2 3 2
  5 2 3 2 2
  5 3 2 2 2

Antti Karttunen, Table of n, a(n) for n = 1..20000

Cf. A008480, A056239, A112798, A325327, A325362, A325364, A325367, A325390, A325392, A325407.

Table[Length[Select[Permutations[Flatten[Table@@@FactorInteger[2*n]]],First[#]!=2&]],{n,100}]

A008480(n) = {my(sig=factor(n)[, 2]); vecsum(sig)!/factorback(apply(k->k!, sig))}; \\ After code in A008480
A325403(n) = (A008480(n+n)-A008480(n)); \\ Antti Karttunen, Dec 06 2021

a(n) = A008480(2n) - A008480(n) = A325392(2n).

Data section extended up to 105 terms by Antti Karttunen, Dec 06 2021

A325363 Heinz numbers of integer partitions into nonzero triangular numbers A000217.

Original entry on oeis.org

1, 2, 4, 5, 8, 10, 13, 16, 20, 25, 26, 29, 32, 40, 47, 50, 52, 58, 64, 65, 73, 80, 94, 100, 104, 107, 116, 125, 128, 130, 145, 146, 151, 160, 169, 188, 197, 200, 208, 214, 232, 235, 250, 256, 257, 260, 290, 292, 302, 317, 320, 325, 338, 365, 376, 377, 394, 397

Offset: 1

Gus Wiseman, May 02 2019

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

The enumeration of these partitions by sum is given by A007294.

			The sequence of terms together with their prime indices begins:
    1: {}
    2: {1}
    4: {1,1}
    5: {3}
    8: {1,1,1}
   10: {1,3}
   13: {6}
   16: {1,1,1,1}
   20: {1,1,3}
   25: {3,3}
   26: {1,6}
   29: {10}
   32: {1,1,1,1,1}
   40: {1,1,1,3}
   47: {15}
   50: {1,3,3}
   52: {1,1,6}
   58: {1,10}
   64: {1,1,1,1,1,1}
   65: {3,6}

Cf. A000217, A007294, A056239, A112798, A240026, A325327, A325360, A325362, A325367, A325390, A325394, A325400.

nn=1000;
primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
trgs=Table[n*(n+1)/2,{n,Sqrt[2*PrimePi[nn]]}];
Select[Range[nn],SubsetQ[trgs,primeMS[#]]&]

cp's OEIS Frontend

A325354 Number of reversed integer partitions of n whose k-th differences are weakly increasing for all k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325400 Heinz numbers of reversed integer partitions whose k-th differences are weakly increasing for all k >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325460 Heinz numbers of integer partitions with strictly increasing differences (with the last part taken to be 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325461 Heinz numbers of integer partitions with strictly decreasing differences (with the last part taken to be 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325392 Number of permutations of the multiset of prime factors of n whose first part is not 2.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A359397 Squarefree numbers with weakly decreasing first differences of 0-prepended prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A325403 Number of permutations of the multiset of prime factors of 2n whose first part is not 2.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A325363 Heinz numbers of integer partitions into nonzero triangular numbers A000217.

Views

Author

Keywords

Comments