A325460 -id:A325460 - cp's OEIS frontend

A325367 Heinz numbers of integer partitions with distinct differences between successive parts (with the last part taken to be zero).

1, 2, 3, 4, 5, 7, 9, 10, 11, 13, 14, 15, 17, 19, 20, 22, 23, 25, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 57, 58, 59, 61, 62, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97

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

			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}
  10: {1,3}
  11: {5}
  13: {6}
  14: {1,4}
  15: {2,3}
  17: {7}
  19: {8}
  20: {1,1,3}
  22: {1,5}
  23: {9}
  25: {3,3}
  26: {1,6}
  28: {1,1,4}

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

Positions of squarefree numbers in A325390.

Cf. A056239, A112798, A130091, A320348, A325324, A325327, A325362, A325364, A325366, A325368, A325388, A325405, A325407, A325460, A325461.

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

A325388 Heinz numbers of strict integer partitions with distinct differences (with the last part taken to be 0).

Original entry on oeis.org

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

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

			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}
   15: {2,3}
   17: {7}
   19: {8}
   22: {1,5}
   23: {9}
   26: {1,6}
   29: {10}
   31: {11}
   33: {2,5}
   34: {1,7}
   35: {3,4}

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

A subsequence of A005117.

Cf. A056239, A112798, A320348, A325324, A325327, A325362, A325364, A325366, A325367, A325368, A325390, A325405, A325460, A325461, A325467.

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

A325390 Heinz number of the negated differences plus one of the integer partition with Heinz number n (with the last part taken to be 0).

Original entry on oeis.org

1, 3, 5, 6, 7, 9, 11, 12, 10, 15, 13, 18, 17, 21, 15, 24, 19, 18, 23, 30, 25, 33, 29, 36, 14, 39, 20, 42, 31, 27, 37, 48, 35, 51, 21, 36, 41, 57, 55, 60, 43, 45, 47, 66, 30, 69, 53, 72, 22, 30, 65, 78, 59, 36, 35, 84, 85, 87, 61, 54, 67, 93, 50, 96, 49, 63, 71

Offset: 1

Gus Wiseman, May 02 2019

nonn

The Heinz number of a positive integer sequence (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 Heinz number of (6,3,1) is 130, and its negated differences plus one are (4,3,2), which has Heinz number 105, so a(130) = 105.

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

Number of appearances of n is A325392(n).
Positions of squarefree numbers are A325367.
Cf. A007294, A007862, A056239, A112798, A320509, A325324, A325327, A325351, A325352, A325362, A325364, A325460, A325461.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Table[Times@@Prime/@(1-Differences[Append[primeptn[n],0]]),{n,100}]

A179269 Number of partitions of n into distinct parts such that the successive differences of consecutive parts are increasing, and first difference > first part.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 5, 5, 5, 7, 7, 7, 10, 10, 10, 13, 14, 14, 18, 19, 19, 23, 25, 25, 30, 32, 33, 38, 41, 42, 48, 52, 54, 60, 65, 67, 75, 81, 84, 92, 99, 103, 113, 121, 126, 136, 147, 153, 165, 177, 184, 197, 213, 221, 236, 253, 264, 280, 301, 313, 331, 355, 371, 390, 418, 435, 458

Offset: 0

Joerg Arndt, Jan 05 2011

nonn

Conditions as in A179254; additionally, if more than 1 part, first difference > first part.

Equivalently, number of partitions for which the sequence of part counts by decreasing part size is 1, 2, 3, ... - Olivier Gérard, Jul 28 2017

			a(10) = 5 as there are 5 such partitions of 10: 1 + 3 + 6 = 1 + 9 = 2 + 8 = 3 + 7 = 10.
a(10) = 5 as there are 5 such partitions of 10: 10, 8 + 1 + 1, 6 + 2 + 2, 4 + 3 + 3, 3 + 2 + 2 + 1 + 1 + 1 (second definition).
From _Gus Wiseman_, May 04 2019: (Start)
The a(3) = 1 through a(13) = 7 partitions whose differences are strictly increasing (with the last part taken to be 0) are the following (A = 10, B = 11, C = 12, D = 13). The Heinz numbers of these partitions are given by A325460.
  (3)  (4)   (5)   (6)   (7)   (8)   (9)   (A)    (B)    (C)    (D)
       (31)  (41)  (51)  (52)  (62)  (72)  (73)   (83)   (93)   (94)
                         (61)  (71)  (81)  (82)   (92)   (A2)   (A3)
                                           (91)   (A1)   (B1)   (B2)
                                           (631)  (731)  (831)  (C1)
                                                                (841)
                                                                (931)
The a(3) = 1 through a(11) = 5 partitions whose multiplicities form an initial interval of positive integers are the following (A = 10, B = 11). The Heinz numbers of these partitions are given by A307895.
  (3)  (4)    (5)    (6)    (7)    (8)    (9)    (A)       (B)
       (211)  (311)  (411)  (322)  (422)  (522)  (433)     (533)
                            (511)  (611)  (711)  (622)     (722)
                                                 (811)     (911)
                                                 (322111)  (422111)
(End)

Andrew Howroyd, Table of n, a(n) for n = 0..10000 (terms 0..200 from Seiichi Manyama)
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Cf. A179254 (condition only on differences), A007294 (nondecreasing instead of strictly increasing), A179255, A320382, A320385, A320387, A320388.

Cf. A007862, A240027, A307895, A320509, A320510, A325324, A325357, A325391, A325460.

Table[Length@
  Select[IntegerPartitions[n],
   And @@ Equal[Range[Length[Split[#]]], Length /@ Split[#]] &], {n,
0, 40}]   (* Olivier Gérard, Jul 28 2017 *)
Table[Length[Select[IntegerPartitions[n],Less@@Differences[Append[#,0]]&]],{n,0,30}] (* Gus Wiseman, May 04 2019 *)

R(n)={my(L=List(), v=vectorv(n, i, 1), w=1, t=1); while(v, listput(L,v); w++; t+=w; v=vectorv(n, i, sum(k=1, (i-1)\t, L[w-1][i-k*t]))); Mat(L)}
seq(n)={my(M=R(n)); concat([1], vector(n, i, vecsum(M[i,])))} \\ Andrew Howroyd, Aug 27 2019

def partition(n, min, max)
  return [[]] if n == 0
  [max, n].min.downto(min).flat_map{|i| partition(n - i, min, i - 1).map{|rest| [i, *rest]}}
end
def f(n)
  return 1 if n == 0
  cnt = 0
  partition(n, 1, n).each{|ary|
    ary << 0
    ary0 = (1..ary.size - 1).map{|i| ary[i - 1] - ary[i]}
    cnt += 1 if ary0.sort == ary0.reverse && ary0.uniq == ary0
  }
  cnt
end
def A179269(n)
  (0..n).map{|i| f(i)}
end
p A179269(50) # Seiichi Manyama, Oct 12 2018

def A179269(n):
    has_increasing_diffs = lambda x: min(differences(x,2)) >= 1
    special = lambda x: (x[1]-x[0]) > x[0]
    allowed = lambda x: (len(x) < 2 or special(x)) and (len(x) < 3 or has_increasing_diffs(x))
    return len([x for x in Partitions(n,max_slope=-1) if allowed(x[::-1])])
# D. S. McNeil, Jan 06 2011

G.f.: Sum_{k>=0} x^(k*(k+1)*(k+2)/6) / Product_{j=1..k} (1 - x^(j*(j+1)/2)) (conjecture). - Ilya Gutkovskiy, Apr 25 2019

A325395 Heinz numbers of integer partitions whose augmented differences are strictly increasing.

Original entry on oeis.org

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

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 augmented differences aug(y) of an integer partition y of length k are given by aug(y)i = y_i - y{i + 1} + 1 if i < k and aug(y)_k = y_k. For example, aug(6,5,5,3,3,3) = (2,1,3,1,1,3).
The enumeration of these partitions by sum is given by A325357.

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

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

Cf. A056239, A093641, A112798, A240027, A325351, A325357, A325366, A325389, A325394, A325396, A325398, A325456, A325460.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
aug[y_]:=Table[If[i

A325456 Heinz numbers of integer partitions with strictly increasing differences.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 51, 52, 53, 55, 57, 58, 59, 61, 62, 63, 65, 66, 67, 68, 69, 71, 73, 74, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87

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) are (-3,-2).
The enumeration of these partitions by sum is given by A240027.

			The sequence of terms together with their prime indices begins:
   1: {}
   2: {1}
   3: {2}
   4: {1,1}
   5: {3}
   6: {1,2}
   7: {4}
   9: {2,2}
  10: {1,3}
  11: {5}
  12: {1,1,2}
  13: {6}
  14: {1,4}
  15: {2,3}
  17: {7}
  19: {8}
  20: {1,1,3}
  21: {2,4}
  22: {1,5}
  23: {9}

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

Cf. A056239, A112798, A179269, A240026, A240027, A325328, A325352, A325360, A325361, A325368, A325395, A325398, A325457, A325460.

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

A307895 Numbers whose prime exponents, starting from the largest prime factor through to the smallest, form an initial interval of positive integers.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 12, 13, 17, 19, 20, 23, 28, 29, 31, 37, 41, 43, 44, 45, 47, 52, 53, 59, 61, 63, 67, 68, 71, 73, 76, 79, 83, 89, 92, 97, 99, 101, 103, 107, 109, 113, 116, 117, 124, 127, 131, 137, 139, 148, 149, 151, 153, 157, 163, 164, 167, 171, 172, 173

Offset: 1

Gus Wiseman, May 04 2019

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are Heinz numbers of integer partitions whose multiplicities, starting from the largest part through to the smallest, form an initial interval of positive integers. 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}
   11: {5}
   12: {1,1,2}
   13: {6}
   17: {7}
   19: {8}
   20: {1,1,3}
   23: {9}
   28: {1,1,4}
   29: {10}
   31: {11}
   37: {12}
   41: {13}
   43: {14}
   44: {1,1,5}
   45: {2,2,3}

Cf. A055932, A056239, A098859, A109298, A112798, A130091, A179269, A317090, A325326, A325337, A325460.

Select[Range[100],Last/@If[#==1,{},FactorInteger[#]]==Range[PrimeNu[#],1,-1]&]

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

cp's OEIS Frontend

A325367 Heinz numbers of integer partitions with distinct differences between successive parts (with the last part taken to be zero).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325388 Heinz numbers of strict integer partitions with distinct differences (with the last part taken to be 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325390 Heinz number of the negated differences plus one of the integer partition with Heinz number n (with the last part taken to be 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A179269 Number of partitions of n into distinct parts such that the successive differences of consecutive parts are increasing, and first difference > first part.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Ruby

Sage

Formula

A325395 Heinz numbers of integer partitions whose augmented differences are strictly increasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325456 Heinz numbers of integer partitions with strictly increasing differences.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A307895 Numbers whose prime exponents, starting from the largest prime factor through to the smallest, form an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

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