A100881 -id:A100881 - cp's OEIS frontend

A098859 Number of partitions of n into parts each of which is used a different number of times.

1, 1, 2, 2, 4, 5, 7, 10, 13, 15, 21, 28, 31, 45, 55, 62, 82, 105, 116, 153, 172, 208, 251, 312, 341, 431, 492, 588, 676, 826, 905, 1120, 1249, 1475, 1676, 2003, 2187, 2625, 2922, 3409, 3810, 4481, 4910, 5792, 6382, 7407, 8186, 9527, 10434

Offset: 0

David S. Newman, Oct 11 2004

Fill, Janson and Ward refer to these partitions as Wilf partitions. - Peter Luschny, Jun 04 2012

			a(6)=7 because 6= 4+1+1= 3+3= 3+1+1+1= 2+2+2= 2+1+1+1+1= 1+1+1+1+1+1. Four unrestricted partitions of 6 are not counted by a(6): 5+1, 4+2, 3+2+1 because at least two different summands are each used once; 2+2+1+1 because each summand is used twice.
From _Gus Wiseman_, Apr 19 2019: (Start)
The a(1) = 1 through a(9) = 15 partitions are the following. The Heinz numbers of these partitions are given by A130091.
  1   2    3     4      5       6        7         8          9
      11   111   22     221     33       322       44         333
                 211    311     222      331       332        441
                 1111   2111    411      511       422        522
                        11111   3111     2221      611        711
                                21111    4111      2222       3222
                                111111   22111     5111       6111
                                         31111     22211      22221
                                         211111    41111      33111
                                         1111111   221111     51111
                                                   311111     411111
                                                   2111111    2211111
                                                   11111111   3111111
                                                              21111111
                                                              111111111
(End)

Simon Langowski and Mark Daniel Ward, Table of n, a(n) for n = 0..2000 (terms 0..300 from M. D. Ward, 301..700 from Maciej Ireneusz Wilczynski)
James Allen Fill, Svante Janson and Mark Daniel Ward, Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert S. Wilf, The Electronic Journal of Combinatorics, Volume 19, Issue 2 (2012)
Daniel Kane and Robert C. Rhoades, Asymptotics for Wilf's partitions with distinct multiplicities
Martin Klazar, What is an answer? — remarks, results and problems on PIO formulas in combinatorial enumeration, part I, arXiv:1808.08449 [math.CO], 2018.
Simon Langowski, Program to compute Wilf Partitions, 2018
Stephan Wagner, The Number of Fixed Points of Wilf's Partition Involution, The Electronic Journal of Combinatorics, 20(4) (2013), #P13.
Doron Zeilberger, Using generatingfunctionology to enumerate distinct-multiplicity partitions; Local copy [Pdf file only, no active links]

Row sums of A182485.
Cf. A100471, A100881, A105637, A211858, A211859, A211860, A211861, A211862, A211863, A242882.
Cf. A047966 (each part appears the same number of times), A090858, A116608, A130091, A325242.

a098859 = p 0 [] 1 where
   p m ms _      0 = if m `elem` ms then 0 else 1
   p m ms k x
     | x < k       = 0
     | m == 0      = p 1 ms k (x - k) + p 0 ms (k + 1) x
     | m `elem` ms = p (m + 1) ms k (x - k)
     | otherwise   = p (m + 1) ms k (x - k) + p 0 (m : ms) (k + 1) x
-- Reinhard Zumkeller, Dec 27 2012

a[n_] := Length[sp = Split /@ IntegerPartitions[n]] - Count[sp, {__List, b_List, ___List, c_List, ___List} /; Length[b] == Length[c]]; Table[a[n], {n, 0, 48}] (* _Jean-François Alcover, Jan 17 2013 *)

a(n)={((r,k,b,w)->if(!k||!r, if(r,0,1), sum(m=0, r\k, if(!m || !bittest(b,m), self()(r-k*m, k-1, bitor(b, 1<Andrew Howroyd, Aug 31 2019

log(a(n)) ~ N*log(N) where N = (6*n)^(1/3) (see Fill, Janson and Ward). - Peter Luschny, Jun 04 2012

Corrected and extended by Vladeta Jovovic, Oct 22 2004

A100883 Number of partitions of n in which the sequence of frequencies of the summands is nondecreasing.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 11, 13, 19, 26, 36, 43, 64, 77, 102, 129, 169, 205, 268, 323, 413, 504, 629, 751, 947, 1131, 1384, 1661, 2024, 2393, 2919, 3442, 4136, 4884, 5834, 6836, 8162, 9531, 11262, 13155, 15493, 17981, 21138, 24472, 28571, 33066, 38475, 44305

Offset: 0

David S. Newman, Nov 21 2004

nonn

From Gus Wiseman, Jan 21 2019: (Start)
Also the number of semistandard Young tableaux where the rows are constant and the entries sum to n. For example, the a(8) = 19 tableaux are:
  8   44   2222   11111111
.
  1   2   11   3   111   22   1111   11   11111   1111   111111
  7   6   6    5   5     4    4      33   3       22     2
.
  1   1   11   111
  2   3   2    2
  5   4   4    3
(End)

			a(5) = 6 because, of the 7 unrestricted partitions of 5, only one, 2 + 2 + 1, has a decreasing sequence of frequencies. Two is used twice, but 1 is used only once.

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Cf. A100881, A100882, A100884.

Cf. A000085, A000219, A003293, A006951, A100471, A323582.

b:= proc(n, i, t) option remember; `if`(n<0, 0, `if`(n=0, 1,
      `if`(i=1, `if`(n>=t, 1, 0), `if`(i=0, 0, b(n, i-1, t)+
       add(b(n-i*j, i-1, j), j=t..floor(n/i))))))
    end:
a:= n-> b(n$2, 1):
seq(a(n), n=0..60);  # Alois P. Heinz, Jul 03 2014

b[n_, i_, t_] := b[n, i, t] = If[n<0, 0, If[n == 0, 1, If[i == 1, If[n >= t, 1, 0], If[i == 0, 0, b[n, i-1, t] + Sum[b[n-i*j, i-1, j], {j, t, Floor[n/i]}]]]]]; a[n_] := b[n, n, 1]; Table[a[n], {n, 0, 60}] (* Jean-François Alcover, Mar 16 2015, after Alois P. Heinz *)
Table[Length[Select[IntegerPartitions[n],OrderedQ[Length/@Split[#]]&]],{n,20}] (* Gus Wiseman, Jan 21 2019 *)

More terms from Vladeta Jovovic, Nov 23 2004

A028859 a(n+2) = 2a(n+1) + 2a(n); a(0) = 1, a(1) = 3.

Original entry on oeis.org

1, 3, 8, 22, 60, 164, 448, 1224, 3344, 9136, 24960, 68192, 186304, 508992, 1390592, 3799168, 10379520, 28357376, 77473792, 211662336, 578272256, 1579869184, 4316282880, 11792304128, 32217174016, 88018956288, 240472260608, 656982433792, 1794909388800, 4903783645184, 13397386067968

Offset: 0

N. J. A. Sloane

Number of words of length n without adjacent 0's from the alphabet {0,1,2}. For example, a(2) counts 01,02,10,11,12,20,21,22. - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Jun 12 2001
Individually, both this sequence and A002605 are convergents to 1+sqrt(3). Mutually, both sequences are convergents to 2+sqrt(3) and 1+sqrt(3)/2. - Klaus E. Kastberg (kastberg(AT)hotkey.net.au), Nov 04 2001 [Can someone clarify what is meant by the obscure second phrase, "Mutually..."? - M. F. Hasler, Aug 06 2018]
Add a loop at two vertices of the graph C_3=K_3. a(n) counts walks of length n+1 between these vertices. - Paul Barry, Oct 15 2004
Prefaced with a 1 as (1 + x + 3x^2 + 8x^3 + 22x^4 + ...) = 1 / (1 - x - 2x^2 - 3x^3 - 5x^4 - 8x^5 - 13x^6 - 21x^7 - ...). - Gary W. Adamson, Jul 28 2009
Equals row 2 of the array in A180165, and the INVERTi transform of A125145. - Gary W. Adamson, Aug 14 2010
Pisano period lengths: 1, 1, 3, 1, 24, 3, 48, 1, 9, 24, 10, 3, 12, 48, 24, 1, 144, 9, 180, 24, .... - R. J. Mathar, Aug 10 2012
Also the number of independent vertex sets and vertex covers in the n-centipede graph. - Eric W. Weisstein, Sep 21 2017
From Gus Wiseman, May 19 2020: (Start)
Conjecture: Also the number of length n + 1 sequences that cover an initial interval of positive integers and whose non-adjacent parts are weakly decreasing. For example, (3,2,3,1,2) has non-adjacent pairs (3,3), (3,1), (3,2), (2,1), (2,2), (3,2), all of which are weakly decreasing, so is counted under a(11). The a(1) = 1 through a(3) = 8 sequences are:
  (1)  (11)  (111)
       (12)  (121)
       (21)  (211)
             (212)
             (221)
             (231)
             (312)
             (321)
The case of compositions is A333148, or A333150 for strict compositions, or A333193 for strictly decreasing parts. A version for ordered set partitions is A332872. Standard composition numbers of these compositions are A334966. Unimodal normal sequences are A227038. See also: A001045, A001523, A032020, A100471, A100881, A115981, A329398, A332836, A332872.
(End)
Number of 2-compositions of n+1 restricted to parts 1 and 2 (and allowed zeros); see Hopkins & Ouvry reference. - Brian Hopkins, Aug 16 2020
The number of ternary strings of length n not containing 00. Complement of A186244. - R. J. Mathar, Feb 13 2022

S. J. Cyvin and I. Gutman, Kekulé structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (see p. 73).

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
Jean-Paul Allouche, Jeffrey Shallit, and Manon Stipulanti, Combinatorics on words and generating Dirichlet series of automatic sequences, arXiv:2401.13524 [math.CO], 2025. See p. 14.
Joerg Arndt, Matters Computational (The Fxtbook), section 14.9 "Strings with no two consecutive zeros", pp.318-320.
C. Bautista-Ramos and C. Guillen-Galvan, Fibonacci numbers of generalized Zykov sums, J. Integer Seq., 15 (2012), #12.7.8.
Moussa Benoumhani, On the Modes of the Independence Polynomial of the Centipede, Journal of Integer Sequences, Vol. 15 (2012), #12.5.1.
D. Birmajer, J. B. Gil, and M. D. Weiner, On the Enumeration of Restricted Words over a Finite Alphabet, J. Int. Seq. 19 (2016) # 16.1.3 Example 7.
Martin Burtscher, Igor Szczyrba, and Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
P. Z. Chinn, R. Grimaldi, and S. Heubach, Tiling with Ls and Squares, J. Int. Sequences 10 (2007) #07.2.8.
David Garth and Adam Gouge, Affinely Self-Generating Sets and Morphisms, Journal of Integer Sequences, Article 07.1.5, 10 (2007) 1-13.
Juan B. Gil and Jessica A. Tomasko, Fibonacci colored compositions and applications, arXiv:2108.06462 [math.CO], 2021.
Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011.
Brian Hopkins and Stéphane Ouvry, Combinatorics of Multicompositions, arXiv:2008.04937 [math.CO], 2020.
Milan Janjic, On Linear Recurrence Equations Arising from Compositions of Positive Integers, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.7.
Tanya Khovanova, Recursive Sequences
J. Shallit, Proof of Irvine's conjecture via mechanized guessing, arXiv preprint arXiv:2310.14252 [math.CO], October 22 2023.
Eric Weisstein's World of Mathematics, Centipede Graph
Eric Weisstein's World of Mathematics, Independent Vertex Set
Eric Weisstein's World of Mathematics, Vertex Cover
Index entries for linear recurrences with constant coefficients, signature (2,2).

Cf. A180165, A125145, A026150, A030195, A080040, A083337, A106435, A108898.
Cf. A155020 (same sequence with term 1 prepended).
Cf. A002605.

a028859 n = a028859_list !! n
a028859_list =
   1 : 3 : map (* 2) (zipWith (+) a028859_list (tail a028859_list))
-- Reinhard Zumkeller, Oct 15 2011

a[0]:=1:a[1]:=3:for n from 2 to 24 do a[n]:=2*a[n-1]+2*a[n-2] od: seq(a[n],n=0..24); # Emeric Deutsch

a[n_]:=(MatrixPower[{{1,3},{1,1}},n].{{2},{1}})[[2,1]]; Table[a[n],{n,0,40}] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2010 *)
Table[2^(n - 1) Hypergeometric2F1[(1 - n)/2, -n/2, -n, -2], {n, 20}] (* Eric W. Weisstein, Jun 14 2017 *)
LinearRecurrence[{2, 2}, {1, 3}, 20] (* Eric W. Weisstein, Jun 14 2017 *)

a(n)=([1,3;1,1]^n*[2;1])[2,1] \\ Charles R Greathouse IV, Mar 27 2012

A028859(n)=([1,1]*[2,2;1,0]^n)[1] \\ M. F. Hasler, Aug 06 2018

a(n) = a(n-1) + A052945(n) = A002605(n) + A002605(n-1).
G.f.: -(x+1)/(2*x^2+2*x-1).
a(n) = [(1+sqrt(3))^(n+2)-(1-sqrt(3))^(n+2)]/(4*sqrt(3)). - Emeric Deutsch, Feb 01 2005
If p[i]=fibonacci(i+1) and if A is the Hessenberg matrix of order n defined by: A[i,j]=p[j-i+1], (i<=j), A[i,j]=-1, (i=j+1), and A[i,j]=0 otherwise. Then, for n>=1, a(n-1)= det A. - Milan Janjic, May 08 2010
a(n) = 3^n - A186244(n). - Toby Gottfried, Mar 07 2013
E.g.f.: exp(x)*(cosh(sqrt(3)*x) + 2*sinh(sqrt(3)*x)/sqrt(3)). - Stefano Spezia, Mar 02 2024

Definition completed by M. F. Hasler, Aug 06 2018

A100882 Number of partitions of n in which the sequence of frequencies of the summands is nonincreasing.

Original entry on oeis.org

1, 1, 2, 3, 4, 5, 8, 8, 12, 14, 18, 21, 29, 29, 40, 47, 56, 62, 83, 86, 111, 124, 146, 166, 207, 217, 267, 300, 352, 389, 471, 505, 604, 668, 772, 860, 1015, 1085, 1279, 1419, 1622, 1780, 2072, 2242, 2595, 2858, 3231, 3563, 4092, 4421, 5057, 5557, 6250

Offset: 0

David S. Newman, Nov 21 2004

nonn

			a(4) = 4 because in each of the partitions 4, 3+1, 2+2, 1+1+1+1, the frequencies of the summands is nonincreasing as the summands decrease. The partition 2+1+1 is not counted because 2 is used once, but 1 is used twice.

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Cf. A100881, A100883, A100884.

b:= proc(n,i,t) option remember;
      if n<0 then 0
    elif n=0 then 1
    elif i=1 then `if`(n<=t, 1, 0)
    elif i=0 then 0
    else      b(n, i-1, t)
         +add(b(n-i*j, i-1, j), j=1..min(t, floor(n/i)))
      fi
    end:
a:= n-> b(n, n, n):
seq(a(n), n=0..60);  # Alois P. Heinz, Feb 21 2011

b[n_, i_, t_] := b[n, i, t] = Which[n<0, 0, n == 0, 1, i == 1, If[n <= t, 1, 0], i == 0, 0, True, b[n, i-1, t] + Sum[b[n-i*j, i-1, j], {j, 1, Min[t, Floor[n/i]]}]]; a[n_] := b[n, n, n]; Table[a[n], {n, 0, 60}] (* Jean-François Alcover, Oct 26 2015, after Alois P. Heinz *)

More terms from Alois P. Heinz, Feb 21 2011

A100471 Number of integer partitions of n whose sequence of frequencies is strictly increasing.

Original entry on oeis.org

1, 1, 2, 2, 4, 4, 7, 8, 11, 13, 18, 20, 27, 32, 40, 44, 60, 67, 82, 93, 114, 129, 161, 175, 209, 239, 285, 315, 372, 416, 484, 545, 631, 698, 811, 890, 1027, 1146, 1304, 1437, 1631, 1805, 2042, 2252, 2539, 2785, 3143, 3439, 3846, 4226, 4722, 5159

Offset: 0

David S. Newman, Nov 21 2004

nonn

			a(4) = 4 because of the 5 unrestricted partitions of 4, only one, 3+1 uses each of its summands just once and 1,1 is not an increasing sequence.
From _Gus Wiseman_, Jan 23 2019: (Start)
The a(1) = 1 through a(8) = 11 integer partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (311)    (33)      (322)      (44)
                    (211)   (2111)   (222)     (511)      (422)
                    (1111)  (11111)  (411)     (4111)     (611)
                                     (3111)    (22111)    (2222)
                                     (21111)   (31111)    (5111)
                                     (111111)  (211111)   (41111)
                                               (1111111)  (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)
(End)

Vaclav Kotesovec, Table of n, a(n) for n = 0..8000 (terms 0..1000 from Alois P. Heinz)

Cf. A000219, A000837 (frequencies are relatively prime), A047966 (frequencies are equal), A098859 (frequencies are distinct), A100881, A100882, A100883, A304686 (Heinz numbers of these partitions).

a100471 n = p 0 (n + 1) 1 n where
   p m m' k x | x == 0    = if m < m' || m == 0 then 1 else 0
              | x < k     = 0
              | m == 0    = p 1 m' k (x - k) + p 0 m' (k + 1) x
              | otherwise = p (m + 1) m' k (x - k) +
                            if m < m' then p 0 m (k + 1) x else 0
-- Reinhard Zumkeller, Dec 27 2012

b:= proc(n,i,t) option remember;
      if n<0 then 0
    elif n=0 then 1
    elif i=1 then `if`(n>t, 1, 0)
    elif i=0 then 0
    else      b(n, i-1, t)
         +add(b(n-i*j, i-1, j), j=t+1..floor(n/i))
      fi
    end:
a:= n-> b(n, n, 0):
seq(a(n), n=0..60);  # Alois P. Heinz, Feb 21 2011

b[n_, i_, t_] := b[n, i, t] = Which[n<0, 0, n==0, 1, i==1, If[n>t, 1, 0], i == 0, 0 , True, b[n, i-1, t] + Sum[b[n-i*j, i-1, j], {j, t+1, Floor[n/i]}]]; a[n_] := b[n, n, 0]; Table[a[n], {n, 0, 60}] (* Jean-François Alcover, Mar 16 2015, after Alois P. Heinz *)
Table[Length[Select[IntegerPartitions[n],OrderedQ@*Split]],{n,20}] (* Gus Wiseman, Jan 23 2019 *)

Corrected and extended by Vladeta Jovovic, Nov 24 2004

Name edited by Gus Wiseman, Jan 23 2019

A304430 Number of partitions of n in which the sequence of the sum of the same summands is decreasing.

Original entry on oeis.org

1, 1, 2, 2, 3, 3, 5, 5, 6, 8, 10, 10, 13, 15, 18, 19, 22, 26, 33, 33, 38, 41, 50, 53, 60, 68, 77, 84, 94, 100, 116, 122, 136, 148, 172, 182, 206, 219, 246, 258, 281, 301, 341, 365, 397, 429, 466, 489, 528, 572, 623, 660, 728, 773, 849, 895, 968, 1019, 1120, 1188, 1288

Offset: 0

Seiichi Manyama, May 12 2018

nonn

Number of integer partitions of n with strictly increasing run-sums. - Gus Wiseman, Oct 22 2022

			n |                      | Sequence of the sum of the same summands
--+----------------------+-----------------------------------------
1 | 1                    | 1
2 | 2                    | 2
  | 1+1                  | 2
3 | 3                    | 3
  | 1+1+1                | 3
4 | 4                    | 4
  | 2+2                  | 4
  | 1+1+1+1              | 4
5 | 5                    | 5
  | 2+1+1+1              | 3, 2
  | 1+1+1+1+1            | 5
6 | 6                    | 6
  | 3+3                  | 6
  | 2+2+2                | 6
  | 2+1+1+1+1            | 4, 2
  | 1+1+1+1+1+1          | 6

The weak opposite version is A304405, ranked by A357875.
The weak version is A304406, ranked by A357861.
The opposite version is A304428, ranked by A357862.
Number of rows in A354584 summing to n that are strictly decreasing.
These partitions are ranked by A357864.
A000041 counts integer partitions, strict A000009.
A304442 counts partitions with equal run-sums, distinct A353837.
Cf. A047966, A087980, A098859, A100471, A100881, A239312, A275870, A353832, A353833, A353864.

Table[Length[Select[IntegerPartitions[n],Less@@Total/@Split[#]&]],{n,0,30}] (* Gus Wiseman, Oct 22 2022 *)

a(n) <= A304406(n).

A383097 Number of integer partitions of n having more than one permutation with all equal run-sums.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 1, 0, 3, 0, 1, 0, 7, 0, 1, 0, 9, 0, 7, 0, 12, 0, 1, 0, 38, 0, 1, 1, 18, 0, 38, 0, 32, 0, 1, 0, 90, 0, 1, 0, 71, 0, 78, 0, 33, 10, 1, 0, 228, 0, 31, 0, 42, 0, 156, 0, 123, 0, 1, 0, 447, 0, 1, 16, 146, 0, 222, 0, 63, 0, 102, 0, 811, 0, 1, 29, 75, 0, 334, 0

Offset: 0

Gus Wiseman, Apr 17 2025

nonn

			The a(27) = 1 partition is: (9,3,3,3,1,1,1,1,1,1,1,1,1).
The a(4) = 1 through a(16) = 9 partitions (empty columns not shown):
  (211)  (3111)  (422)     (511111)  (633)        (71111111)  (844)
                 (41111)             (6222)                   (82222)
                 (221111)            (33222)                  (442222)
                                     (4221111)                (44221111)
                                     (6111111)                (422221111)
                                     (33111111)               (811111111)
                                     (222111111)              (4411111111)
                                                              (42211111111)
                                                              (222211111111)

These partitions are ranked by A383015, positions of terms > 1 in A382877.
For run-lengths instead of sums we have A383090, ranks A383089, unique A383094.
The complement is A383095 + A383096, ranks A383099 \/ A383100.
For any positive number of permutations we have A383098, ranks A383110.
Counting and ranking partitions by run-lengths and run-sums:
- constant: A047966 (ranks A072774), sums A304442 (ranks A353833)
- distinct: A098859 (ranks A130091), sums A353837 (ranks A353838)
- weakly decreasing: A100882 (ranks A242031), sums A304405 (ranks A357875)
- weakly increasing: A100883 (ranks A304678), sums A304406 (ranks A357861)
- strictly decreasing: A100881 (ranks A304686), sums A304428 (ranks A357862)
- strictly increasing: A100471 (ranks A334965), sums A304430 (ranks A357864)
A275870 counts collapsible partitions, ranks A300273.
A326534 ranks multiset partitions with a common sum, counted by A321455, normal A326518.
A353851 counts compositions with all equal run-sums, ranks A353848.
A382876 counts permutations of prime indices with distinct run-sums, zeros A381636.
Cf. A006171, A329738, A353832, A353839, A353850, A353932, A354584, A381717, A382076.

Table[Length[Select[IntegerPartitions[n],Length[Select[Permutations[#],SameQ@@Total/@Split[#]&]]>1&]],{n,0,15}]

More terms from Bert Dobbelaere, Apr 26 2025

A334965 Numbers with strictly increasing prime multiplicities.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 18, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 50, 53, 54, 59, 61, 64, 67, 71, 73, 75, 79, 81, 83, 89, 97, 98, 101, 103, 107, 108, 109, 113, 121, 125, 127, 128, 131, 137, 139, 147, 149, 151, 157, 162, 163, 167, 169

Offset: 1

Gus Wiseman, May 18 2020

nonn

First differs from A329131 in lacking 150.

Also numbers whose unsorted prime signature is strictly increasing.

			The sequence of terms together with their prime indices begins:
    1: {}            25: {3,3}           64: {1,1,1,1,1,1}
    2: {1}           27: {2,2,2}         67: {19}
    3: {2}           29: {10}            71: {20}
    4: {1,1}         31: {11}            73: {21}
    5: {3}           32: {1,1,1,1,1}     75: {2,3,3}
    7: {4}           37: {12}            79: {22}
    8: {1,1,1}       41: {13}            81: {2,2,2,2}
    9: {2,2}         43: {14}            83: {23}
   11: {5}           47: {15}            89: {24}
   13: {6}           49: {4,4}           97: {25}
   16: {1,1,1,1}     50: {1,3,3}         98: {1,4,4}
   17: {7}           53: {16}           101: {26}
   18: {1,2,2}       54: {1,2,2,2}      103: {27}
   19: {8}           59: {17}           107: {28}
   23: {9}           61: {18}           108: {1,1,2,2,2}

These are the Heinz numbers of the partitions counted by A100471.
Partitions with strictly decreasing run-lengths are A100881.
Partitions with weakly decreasing run-lengths are A100882.
Partitions with weakly increasing run-lengths are A100883.
The weakly decreasing version is A242031.
The weakly increasing version is A304678.
The strictly decreasing version is A304686.
Compositions with strictly increasing or decreasing run-lengths are A333191.
Cf. A000837, A032020, A098859, A100883, A329744, A332835, A333147, A333190.

Select[Range[100],Less@@Last/@FactorInteger[#]&]

A383095 Number of integer partitions of n having exactly one permutation with all equal run-sums.

Original entry on oeis.org

1, 1, 2, 2, 3, 2, 6, 2, 4, 5, 6, 2, 12, 2, 6, 8, 5, 2, 20, 2, 12, 8, 6, 2, 20, 5, 6, 12, 12, 2, 34, 2, 6, 8, 6, 8, 45, 2, 6, 8, 20, 2, 34, 2, 12, 28, 6, 2, 30, 5, 20, 8, 12, 2, 52, 8, 20, 8, 6, 2, 78, 2, 6, 28, 7, 8, 34, 2, 12, 8, 34, 2, 80, 2, 6, 28, 12, 8, 34, 2, 30, 25

Offset: 0

Gus Wiseman, Apr 16 2025

nonn

			The partition (2,2,1,1) has permutation (2,1,1,2) so is counted under a(6).
The a(1) = 1 through a(10) = 6 partitions (A=10):
  1  2   3    4     5      6       7        8         9          A
     11  111  22    11111  33      1111111  44        333        55
              1111         222              2222      33111      22222
                           2211             11111111  3111111    2221111
                           21111                      111111111  22111111
                           111111                                1111111111

For distinct instead of equal run-sums we have A000005.
For run-lengths instead of sums we have A383094.
The complement is counted by A383096 + A383097, ranks A383100 \/ A383015.
These partitions are ranked by A383099 = positions of 1 in A382877.
Counting and ranking partitions by run-lengths and run-sums:
- constant: A047966 (ranks A072774), sums A304442 (ranks A353833)
- distinct: A098859 (ranks A130091), sums A353837 (ranks A353838)
- weakly decreasing: A100882 (ranks A242031), sums A304405 (ranks A357875)
- weakly increasing: A100883 (ranks A304678), sums A304406 (ranks A357861)
- strictly decreasing: A100881 (ranks A304686), sums A304428 (ranks A357862)
- strictly increasing: A100471 (ranks A334965), sums A304430 (ranks A357864)
A275870 counts collapsible partitions, ranks A300273.
A326534 ranks multiset partitions with a common sum, counted by A321455, normal A326518.
A353851 counts compositions with all equal run-sums, ranks A353848.
A383098 counts partitions with a permutation having all equal run-sums, ranks A383110.
Cf. A329738, A353839, A353832, A353932, A354584, A381636, A381871, A382076, A382876.

Table[Length[Select[IntegerPartitions[n], Length[Select[Permutations[#], SameQ@@Total/@Split[#]&]]==1&]],{n,0,15}]

More terms from Bert Dobbelaere, Apr 26 2025

A383098 Number of integer partitions of n having at least one permutation with all equal run-sums.

Original entry on oeis.org

1, 1, 2, 2, 4, 2, 7, 2, 7, 5, 7, 2, 19, 2, 7, 8, 14, 2, 27, 2, 24, 8, 7, 2, 58, 5, 7, 13, 30, 2, 72, 2, 38, 8, 7, 8, 135, 2, 7, 8, 91, 2, 112, 2, 45, 38, 7, 2, 258, 5, 51, 8, 54, 2, 208, 8, 143, 8, 7, 2, 525, 2, 7, 44, 153, 8, 256, 2, 75, 8, 136, 2, 891, 2, 7, 57, 87, 8

Offset: 0

Gus Wiseman, Apr 17 2025

nonn

			The partition (4,4,4,2,2,1,1,1,1) has permutations (4,2,2,4,1,1,1,1,4) and (4,1,1,1,1,4,2,2,4) so is counted under a(20).
The a(1) = 1 through a(10) = 7 partitions (A=10):
  1  2   3    4     5      6       7        8         9          A
     11  111  22    11111  33      1111111  44        333        55
              211          222              422       33111      22222
              1111         2211             2222      3111111    511111
                           3111             41111     111111111  2221111
                           21111            221111               22111111
                           111111           11111111             1111111111

For distinct instead of equal run-sums we appear to have A382427.
For run-lengths instead of sums we have A383013, ranked by complement of A382879.
The case of a unique choice is A383095, ranks A383099 = positions of 1 in A382877.
The complement is counted by A383096, ranks A383100 = positions of 0 in A382877.
These partitions are ranked by A383110.
The case of more than one choice is A383097, ranks A383015.
Counting and ranking partitions by run-lengths and run-sums:
- constant: A047966 (ranks A072774), sums A304442 (ranks A353833)
- distinct: A098859 (ranks A130091), sums A353837 (ranks A353838)
- weakly decreasing: A100882 (ranks A242031), sums A304405 (ranks A357875)
- weakly increasing: A100883 (ranks A304678), sums A304406 (ranks A357861)
- strictly decreasing: A100881 (ranks A304686), sums A304428 (ranks A357862)
- strictly increasing: A100471 (ranks A334965), sums A304430 (ranks A357864)
A275870 counts collapsible partitions, ranks A300273.
A326534 ranks multiset partitions with a common sum, counted by A321455, normal A326518.
A353851 counts compositions with all equal run-sums, ranks A353848.
Cf. A006171, A329738, A353832, A353839, A353850, A353932, A354584, A382076, A382857, A382876, A383094, A383112.

Table[Length[Select[IntegerPartitions[n],Select[Permutations[#],SameQ@@Total/@Split[#]&]!={}&]],{n,0,15}]

a(n) = A383097(n) + A383095(n), ranks A383015 \/ A383099.

More terms from Bert Dobbelaere, Apr 26 2025

cp's OEIS Frontend

A098859 Number of partitions of n into parts each of which is used a different number of times.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A100883 Number of partitions of n in which the sequence of frequencies of the summands is nondecreasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Extensions

A028859 a(n+2) = 2*a(n+1) + 2*a(n); a(0) = 1, a(1) = 3.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Formula

Extensions

A100882 Number of partitions of n in which the sequence of frequencies of the summands is nonincreasing.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Extensions

A100471 Number of integer partitions of n whose sequence of frequencies is strictly increasing.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Extensions

A304430 Number of partitions of n in which the sequence of the sum of the same summands is decreasing.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A383097 Number of integer partitions of n having more than one permutation with all equal run-sums.

Views

Author

Keywords

A028859 a(n+2) = 2a(n+1) + 2a(n); a(0) = 1, a(1) = 3.