cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A225486 Maximal frequency depth for the partitions of n.

Original entry on oeis.org

0, 2, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
Offset: 1

Views

Author

Clark Kimberling, May 08 2013

Keywords

Comments

See A225485 for the definition of frequency depth.
The frequency depth of an integer partition is the number of times one must take the multiset of multiplicities to reach (1). For example, the partition (32211) has frequency depth 5 because we have: (32211) -> (221) -> (21) -> (11) -> (2) -> (1). Differs from A325282 at a(0) and a(1). - Gus Wiseman, Apr 19 2019

Examples

			(See A225485.)
		

Crossrefs

Run lengths are A325258, i.e., first differences of Levine's sequence A011784.

Programs

  • Mathematica
    c[s_] := c[s] = Select[Table[Count[s, i], {i, 1, Max[s]}], # > 0 &]
    f[s_] := f[s] = Drop[FixedPointList[c, s], -2]
    t[s_] := t[s] = Length[f[s]]
    u[n_] := u[n] = Table[t[Part[IntegerPartitions[n], k]],
        {k, 1, Length[IntegerPartitions[n]]}];
    Prepend[Table[Max[u[n]], {n, 2, 10}], 0]
    (* second program *)
    grw[q_]:=Join@@Table[ConstantArray[i,q[[Length[q]-i+1]]],{i,Length[q]}];
    Join@@MapIndexed[ConstantArray[#2[[1]]-1,#1]&,Length[#]-Last[#]&/@NestList[grw,{1,1},6]] (* Gus Wiseman, Apr 19 2019 *)

Formula

a(n) = number of terms in row n of the array in A225485, for n > 0.

Extensions

More terms from Gus Wiseman, Apr 19 2019

A325282 Maximum adjusted frequency depth among integer partitions of n.

Original entry on oeis.org

0, 1, 2, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
Offset: 0

Views

Author

Gus Wiseman, Apr 18 2019

Keywords

Comments

The adjusted frequency depth of an integer partition is 0 if the partition is empty, and otherwise it is one plus the number of times one must take the multiset of multiplicities to reach a singleton. For example, the partition (32211) has adjusted frequency depth 5 because we have: (32211) -> (221) -> (21) -> (11) -> (2).
The term "frequency depth" appears to have been coined by Clark Kimberling in A225485 and A225486, and can be applied to both integers (A323014) and integer partitions (A325280).
Run lengths are A325258, i.e., first differences of Levine's sequence A011784 (except at n = 1).

Crossrefs

Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (length/frequency depth).

Programs

  • Mathematica
    fdadj[ptn_List]:=If[ptn=={},0,Length[NestWhileList[Sort[Length/@Split[#]]&,ptn,Length[#]>1&]]];
    Table[Max@@fdadj/@IntegerPartitions[n],{n,0,30}]

Formula

a(0) = 0; a(1) = 1; a(n > 1) = A225486(n).

A325258 a(1) = 1; otherwise, first differences of Levine's sequence A011784.

Original entry on oeis.org

1, 1, 1, 1, 3, 7, 28, 171, 2624, 172613, 139584150, 6837485347187, 266437138079023501057, 508009471379222384299345337895696, 37745517525533091954228691786161750063795478326636142, 5347426383812697233786139576220412396732847744407175515852823296919414647252347610750
Offset: 0

Views

Author

Gus Wiseman, Apr 16 2019

Keywords

Comments

a(n) is the number of nonnegative integers k such that the maximum adjusted frequency depth among integer partitions of k is n. For example, the a(5) = 7 numbers are 7, 8, 9, 10, 11, 12, and 13.
The adjusted frequency depth of an integer partition is 0 if the partition is empty, and otherwise it is 1 plus the number of times one must take the multiset of multiplicities to reach a singleton. For example, the partition (32211) has adjusted frequency depth 5 because we have: (32211) -> (221) -> (21) -> (11) -> (2). The enumeration of integer partitions by adjusted frequency depth is given by A325280. The adjusted frequency depth of the integer partition with Heinz number n is A323014(n). The maximum adjusted frequency depth for partitions of n is A325282(n).

Crossrefs

Programs

  • Mathematica
    grw[q_]:=Join@@Table[ConstantArray[i,q[[Length[q]-i+1]]],{i,Length[q]}];
    ReplacePart[Differences[Last/@NestList[grw,{1,1},9]],2->1]

A325254 Number of integer partitions of n with the maximum adjusted frequency depth for partitions of n.

Original entry on oeis.org

0, 1, 1, 1, 1, 3, 3, 1, 3, 7, 10, 17, 27, 38, 1, 4, 8, 17, 31, 52, 83, 122, 181, 257, 361, 499, 684, 910, 1211, 1595, 2060, 2663, 3406, 4315, 5426, 6784, 8417, 10466, 12824, 15721, 19104, 23267, 1, 5, 14, 36, 76, 143, 269, 446, 738, 1143, 1754, 2570, 3742, 5269
Offset: 0

Views

Author

Gus Wiseman, Apr 16 2019

Keywords

Comments

The Heinz numbers of these partitions are given by A325283.
The adjusted frequency depth of an integer partition is 0 if the partition is empty, and otherwise it is 1 plus the number of times one must take the multiset of multiplicities to reach a singleton. For example, the partition (32211) has adjusted frequency depth 5 because we have: (32211) -> (221) -> (21) -> (11) -> (2). The enumeration of integer partitions by adjusted frequency depth is given by A325280. The adjusted frequency depth of the integer partition with Heinz number n is given by A323014. The maximum adjusted frequency depth for integer partitions of n is given by A325282.
Essentially, the last numbers of rows of the array in A225485. - Clark Kimberling, Sep 13 2022

Examples

			The a(1) = 1 through a(11) = 17 partitions:
  1  11  21  211  221   411    3211  3221   3321    5221     4322
                  311   3111         4211   4221    5311     4331
                  2111  21111        32111  4311    6211     4421
                                            5211    32221    5411
                                            32211   33211    6221
                                            42111   42211    6311
                                            321111  43111    7211
                                                    52111    33221
                                                    421111   42221
                                                    3211111  43211
                                                             52211
                                                             53111
                                                             62111
                                                             431111
                                                             521111
                                                             4211111
                                                             32111111
		

Crossrefs

Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (length/frequency depth).

Programs

  • Mathematica
    nn=30;
    fdadj[ptn_List]:=If[ptn=={},0,Length[NestWhileList[Sort[Length/@Split[#]]&,ptn,Length[#]>1&]]];
    mfds=Table[Max@@fdadj/@IntegerPartitions[n],{n,nn}];
    Table[Length[Select[IntegerPartitions[n],fdadj[#]==mfds[[n]]&]],{n,0,nn}]

A325266 Numbers whose adjusted frequency depth equals their number of prime factors counted with multiplicity.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 9, 11, 13, 17, 19, 23, 24, 25, 29, 30, 31, 37, 40, 41, 42, 43, 47, 49, 53, 54, 56, 59, 61, 66, 67, 70, 71, 73, 78, 79, 83, 88, 89, 97, 101, 102, 103, 104, 105, 107, 109, 110, 113, 114, 120, 121, 127, 130, 131, 135, 136, 137, 138, 139, 149
Offset: 1

Views

Author

Gus Wiseman, Apr 17 2019

Keywords

Comments

The adjusted frequency depth of a positive integer n is 0 if n = 1, and otherwise it is 1 plus the number of times one must apply A181819 to reach a prime number, where A181819(n = p^i*...*q^j) = prime(i)*...*prime(j) = product of primes indexed by the prime exponents of n. For example, 180 has adjusted frequency depth 5 because we have: 180 -> 18 -> 6 -> 4 -> 3.
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 adjusted frequency depth is equal to their length. The enumeration of these partitions by sum is given by A325246.

Examples

			The sequence of terms together with their prime indices and their omega-sequences (see A323023) begins:
   2:       {1} (1)
   3:       {2} (1)
   4:     {1,1} (2,1)
   5:       {3} (1)
   7:       {4} (1)
   9:     {2,2} (2,1)
  11:       {5} (1)
  13:       {6} (1)
  17:       {7} (1)
  19:       {8} (1)
  23:       {9} (1)
  24: {1,1,1,2} (4,2,2,1)
  25:     {3,3} (2,1)
  29:      {10} (1)
  30:   {1,2,3} (3,3,1)
  31:      {11} (1)
  37:      {12} (1)
  40: {1,1,1,3} (4,2,2,1)
  41:      {13} (1)
  42:   {1,2,4} (3,3,1)
		

Crossrefs

Omega-sequence statistics: A001222 (first omega), A001221 (second omega), A071625 (third omega), A323022 (fourth omega), A304465 (second-to-last omega), A182850 or A323014 (length/frequency depth), A325248 (Heinz number).

Programs

  • Mathematica
    fdadj[n_Integer]:=If[n==1,0,Length[NestWhileList[Times@@Prime/@Last/@FactorInteger[#]&,n,!PrimeQ[#]&]]];
    Select[Range[100],fdadj[#]==PrimeOmega[#]&]

A325256 Number of normal multisets of size n whose adjusted frequency depth is the maximum for multisets of that size.

Original entry on oeis.org

1, 1, 1, 2, 3, 10, 12, 12, 44, 128, 228, 422, 968, 1750, 420, 2100
Offset: 0

Views

Author

Gus Wiseman, Apr 18 2019

Keywords

Comments

A multiset is normal if its union is an initial interval of positive integers.
The adjusted frequency depth of a multiset is 0 if the multiset is empty, and otherwise it is one plus the number of times one must take the multiset of multiplicities to reach a singleton. For example, the multiset {1,1,2,2,3} has adjusted frequency depth 5 because we have {1,1,2,2,3} -> {1,2,2} -> {1,2} -> {1,1} -> {2}. The enumeration of integer partitions by adjusted frequency depth is given by A325280. The adjusted frequency depth of the integer partition with Heinz number n is A323014(n).

Examples

			The a(1) = 1 through a(7) = 12 multisets:
  {1}  {12}  {112}  {1123}  {11123}  {111123}  {1112234}
             {122}  {1223}  {11223}  {111234}  {1112334}
                    {1233}  {11233}  {112345}  {1112344}
                            {11234}  {122223}  {1122234}
                            {12223}  {122234}  {1123334}
                            {12233}  {122345}  {1123444}
                            {12234}  {123333}  {1222334}
                            {12333}  {123334}  {1222344}
                            {12334}  {123345}  {1223334}
                            {12344}  {123444}  {1223444}
                                     {123445}  {1233344}
                                     {123455}  {1233444}
		

Crossrefs

Programs

  • Mathematica
    nn=10;
    allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]];
    fdadj[ptn_List]:=If[ptn=={},0,Length[NestWhileList[Sort[Length/@Split[#1]]&,ptn,Length[#1]>1&]]];
    mfdm=Table[Max@@fdadj/@allnorm[n],{n,0,nn}];
    Table[Length[Select[allnorm[n],fdadj[#]==mfdm[[n+1]]&]],{n,0,nn}]
Showing 1-6 of 6 results.