A325324 -id:A325324 - cp's OEIS frontend

A384008 Irregular triangle read by rows where row n lists the first differences of the 0-prepended prime indices of the n-th squarefree number.

1, 2, 3, 1, 1, 4, 1, 2, 5, 6, 1, 3, 2, 1, 7, 8, 2, 2, 1, 4, 9, 1, 5, 10, 1, 1, 1, 11, 2, 3, 1, 6, 3, 1, 12, 1, 7, 2, 4, 13, 1, 1, 2, 14, 1, 8, 15, 2, 5, 16, 3, 2, 2, 6, 1, 9, 17, 18, 1, 10, 3, 3, 1, 1, 3, 19, 2, 7, 1, 2, 1, 20, 21, 1, 11, 4, 1, 1, 1, 4, 22, 1, 12, 23, 3, 4

Offset: 1

Gus Wiseman, May 23 2025

All rows are different.

			The 28-th squarefree number is 42, with 0-prepended prime indices (0,1,2,4), with differences (1,1,2), so row 28 is (1,1,2).
The squarefree numbers and corresponding rows begin:
    1: ()        23: (9)        47: (15)
    2: (1)       26: (1,5)      51: (2,5)
    3: (2)       29: (10)       53: (16)
    5: (3)       30: (1,1,1)    55: (3,2)
    6: (1,1)     31: (11)       57: (2,6)
    7: (4)       33: (2,3)      58: (1,9)
   10: (1,2)     34: (1,6)      59: (17)
   11: (5)       35: (3,1)      61: (18)
   13: (6)       37: (12)       62: (1,10)
   14: (1,3)     38: (1,7)      65: (3,3)
   15: (2,1)     39: (2,4)      66: (1,1,3)
   17: (7)       41: (13)       67: (19)
   19: (8)       42: (1,1,2)    69: (2,7)
   21: (2,2)     43: (14)       70: (1,2,1)
   22: (1,4)     46: (1,8)      71: (20)

Row-lengths are A072047, sums A243290.
This is the restriction of A383534 (ranked by A383535) to rows of squarefree index.
A000040 lists the primes, differences A001223.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A320348 counts strict partitions with distinct 0-appended differences, ranks A325388.
A325324 counts partitions with distinct 0-appended differences, ranks A325367.
Cf. A001221, A005117, A055396, A061395, A325325, A355536, A358137, A384009.

sql=Select[Range[100],SquareFreeQ];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Differences[Prepend[prix[sql[[n]]],0]],{n,Length[sql]}]

A385574 Number of integer partitions of n with the same number of adjacent equal parts as adjacent unequal parts.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 2, 4, 5, 6, 10, 11, 13, 17, 20, 30, 36, 44, 55, 70, 86, 98, 128, 156, 190, 235, 288, 351, 409, 499, 603, 722, 863, 1025, 1227, 1461, 1757, 2061, 2444, 2892, 3406, 3996, 4708, 5497, 6430, 7595, 8835, 10294, 12027, 13971, 16252, 18887, 21878

Offset: 0

Gus Wiseman, Jul 04 2025

nonn

These are also integer partitions of n with the same number of distinct parts as maximal anti-runs of parts.

			The partition (5,3,2,1,1,1,1) has 4 runs ((5),(3),(2),(1,1,1,1)) and 4 anti-runs ((5,3,2,1),(1),(1),(1)) so is counted under a(14).
The a(1) = 1 through a(10) = 10 reversed partitions (A = 10):
  (1)  (2)  (3)  (4)    (5)    (6)    (7)    (8)      (9)      (A)
                 (112)  (113)  (114)  (115)  (116)    (117)    (118)
                        (122)         (133)  (224)    (144)    (226)
                                      (223)  (233)    (225)    (244)
                                             (11123)  (11124)  (334)
                                                      (11223)  (11125)
                                                               (11134)
                                                               (11224)
                                                               (11233)
                                                               (12223)

Christian Sievers, Table of n, a(n) for n = 0..1000

The RHS is counted by A116608, rank statistic A297155.
The LHS is counted by A133121, rank statistic A046660.
For related inequalities see A212165, A212168, A361204.
For subsets instead of partitions see A217615, A385572, A385575.
These partitions are ranked by A385576.
A000041 counts integer partitions, strict A000009.
A007690 counts partitions with no singletons, complement A183558.
A034296 counts flat or gapless partitions, ranks A066311 or A073491.
A034839 counts subsets by number maximal runs, for partitions A384881, strict A116674.
A047993 counts partitions with max part = length (A106529).
A098859 counts Wilf partitions (complement A336866), compositions A242882.
A268193 counts partitions by maximal anti-runs, strict A384905, subsets A384893.
A355394 counts partitions with neighbors, complement A356236.
Cf. A000071, A003114, A008284, A010027, A047966, A210034, A325324, A325325, A356606, A384882, A384885.

Table[Length[Select[Reverse/@IntegerPartitions[n],Length[Union[#]]==Length[Split[#,#2!=#1&]]&]],{n,0,30}]

lista(n)=Vec(polcoef((prod(i=1,n,1+x^i/(t*(1-t*x^i))+O(x*x^n))-1)*t+1,0,t)) \\ Christian Sievers, Jul 18 2025

For a partition p, let s(p) be its sum, e(p) the number of equal adjacent pairs, and d(p) the number of distinct adjacent pairs. Then Sum_{p partition} x^s(p) * t^(e(p)-d(p)) = (Product_{i>=1} (1 + x^i/(t*(1-t*x^i))) - 1) * t + 1, so a(n) is the coefficient of x^n*t^0 of this expression. - Christian Sievers, Jul 18 2025

cp's OEIS Frontend

A384008 Irregular triangle read by rows where row n lists the first differences of the 0-prepended prime indices of the n-th squarefree number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica