A001462 -id:A001462 - cp's OEIS frontend

A332297 Number of narrowly totally strongly normal integer partitions of n.

1, 1, 2, 3, 2, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2

Offset: 0

Gus Wiseman, Feb 15 2020

A partition is narrowly totally strongly normal if either it is empty, a singleton (narrow), or it covers an initial interval of positive integers (normal) and has weakly decreasing run-lengths (strong) that are themselves a narrowly totally strongly normal partition.

			The a(1) = 1, a(2) = 2, a(3) = 3, and a(55) = 4 partitions:
  (1)  (2)    (3)      (55)
       (1,1)  (2,1)    (10,9,8,7,6,5,4,3,2,1)
              (1,1,1)  (5,5,5,5,5,4,4,4,4,3,3,3,2,2,1)
                       (1)^55
For example, starting with the partition (3,3,2,2,1) and repeatedly taking run-lengths gives (3,3,2,2,1) -> (2,2,1) -> (2,1) -> (1,1) -> (2). The first four are normal and have weakly decreasing run-lengths, and the last is a singleton, so (3,3,2,2,1) is counted under a(11).

Normal partitions are A000009.
The non-totally normal version is A316496.
The widely alternating version is A332292.
The non-strong case of compositions is A332296.
The case of compositions is A332336.
The wide version is a(n) - 1 for n > 1.
Cf. A001462, A025487, A100883, A181819, A182850, A317081, A317245, A317256, A317491, A332275, A332277, A332278, A332291, A332337.

tinQ[q_]:=Or[q=={},Length[q]==1,And[Union[q]==Range[Max[q]],GreaterEqual@@Length/@Split[q],tinQ[Length/@Split[q]]]];
Table[Length[Select[IntegerPartitions[n],tinQ]],{n,0,30}]

a(60)-a(80) from Jinyuan Wang, Jun 26 2020

A331784 Lexicographically earliest sequence of positive integers that have at most one prime index already in the sequence, counting multiplicity.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 14, 17, 19, 21, 23, 26, 29, 31, 35, 37, 38, 39, 41, 43, 46, 47, 49, 53, 57, 58, 59, 61, 65, 67, 69, 71, 73, 74, 77, 79, 83, 87, 89, 91, 94, 95, 97, 98, 101, 103, 106, 107, 109, 111, 113, 115, 119, 122, 127, 131, 133, 137, 139, 141, 142

Offset: 1

Gus Wiseman, Feb 01 2020

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.

Conjecture: A331912(n)/a(n) -> 1 as n -> infinity.

			The sequence of terms together with their prime indices begins:
    1: {}        43: {14}       91: {4,6}      141: {2,15}
    2: {1}       46: {1,9}      94: {1,15}     142: {1,20}
    3: {2}       47: {15}       95: {3,8}      143: {5,6}
    5: {3}       49: {4,4}      97: {25}       145: {3,10}
    7: {4}       53: {16}       98: {1,4,4}    147: {2,4,4}
   11: {5}       57: {2,8}     101: {26}       149: {35}
   13: {6}       58: {1,10}    103: {27}       151: {36}
   14: {1,4}     59: {17}      106: {1,16}     157: {37}
   17: {7}       61: {18}      107: {28}       158: {1,22}
   19: {8}       65: {3,6}     109: {29}       159: {2,16}
   21: {2,4}     67: {19}      111: {2,12}     161: {4,9}
   23: {9}       69: {2,9}     113: {30}       163: {38}
   26: {1,6}     71: {20}      115: {3,9}      167: {39}
   29: {10}      73: {21}      119: {4,7}      169: {6,6}
   31: {11}      74: {1,12}    122: {1,18}     173: {40}
   35: {3,4}     77: {4,5}     127: {31}       178: {1,24}
   37: {12}      79: {22}      131: {32}       179: {41}
   38: {1,8}     83: {23}      133: {4,8}      181: {42}
   39: {2,6}     87: {2,10}    137: {33}       182: {1,4,6}
   41: {13}      89: {24}      139: {34}       183: {2,18}
For example, the prime indices of 95 are {3,8}, of which only 3 is in the sequence, so 95 is in the sequence.

Gus Wiseman, Plot of A331912(n)/A331784(n) for n = 1..3729.

Contains all prime numbers A000040.
Numbers S without all prime indices in S are A324694.
Numbers S without any prime indices in S are A324695.
Numbers S with exactly one prime index in S are A331785.
Numbers S with at most one distinct prime index in S are A331912.
Numbers S with exactly one distinct prime index in S are A331913.
Cf. A000002, A000720, A001222, A001462, A324696, A331683, A331873, A331914.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
aQ[n_]:=Length[Cases[primeMS[n],_?aQ]]<=1;
Select[Range[100],aQ]

A332275 Number of totally co-strong integer partitions of n.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 11, 12, 17, 22, 30, 32, 49, 53, 70, 82, 108, 119, 156, 171, 219, 250, 305, 336, 424, 468, 562, 637, 754, 835, 1011, 1108, 1304, 1461, 1692, 1873, 2212, 2417, 2787, 3109, 3562, 3911, 4536, 4947, 5653, 6265, 7076, 7758, 8883, 9669, 10945, 12040

Offset: 0

Gus Wiseman, Feb 12 2020

nonn

A sequence is totally co-strong if it is empty, equal to (1), or its run-lengths are weakly increasing (co-strong) and are themselves a totally co-strong sequence.

Also the number of totally strong reversed integer partitions of n.

			The a(1) = 1 through a(7) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (21)   (22)    (32)     (33)      (43)
             (111)  (31)    (41)     (42)      (52)
                    (211)   (311)    (51)      (61)
                    (1111)  (2111)   (222)     (322)
                            (11111)  (321)     (421)
                                     (411)     (511)
                                     (2211)    (4111)
                                     (3111)    (22111)
                                     (21111)   (31111)
                                     (111111)  (211111)
                                               (1111111)
For example, the partition y = (5,4,4,4,3,3,3,2,2,2,2,2,2,1,1,1,1,1,1) has run-lengths (1,3,3,6,6), with run-lengths (1,2,2), with run-lengths (1,2), with run-lengths (1,1), with run-lengths (2), with run-lengths (1). All of these having weakly increasing run-lengths, and the last is (1), so y is counted under a(44).

The strong version is A316496.
The version for reversed partitions is (also) A316496.
The alternating version is A317256.
The generalization to compositions is A332274.
Cf. A001462, A100883, A181819, A182850, A317491, A329746, A332289, A332297, A332336, A332337, A332338, A332339, A332340.

totincQ[q_]:=Or[q=={},q=={1},And[LessEqual@@Length/@Split[q],totincQ[Length/@Split[q]]]];
Table[Length[Select[IntegerPartitions[n],totincQ]],{n,0,30}]

A324748 Number of strict integer partitions of n containing all prime indices of the parts.

Original entry on oeis.org

1, 1, 0, 1, 0, 1, 1, 1, 0, 2, 1, 2, 3, 2, 2, 4, 3, 4, 3, 5, 6, 9, 8, 7, 8, 11, 12, 13, 15, 17, 22, 22, 20, 28, 31, 32, 36, 41, 43, 53, 53, 59, 70, 76, 77, 89, 99, 108, 124, 135, 139, 160, 172, 188, 209, 229, 243, 274, 298, 315, 353, 391, 417, 457, 496, 538, 588

Offset: 0

Gus Wiseman, Mar 15 2019

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.

			The first 15 terms count the following integer partitions.
   1: (1)
   3: (2,1)
   5: (4,1)
   6: (3,2,1)
   7: (4,2,1)
   9: (8,1)
   9: (6,2,1)
  10: (4,3,2,1)
  11: (8,2,1)
  11: (5,3,2,1)
  12: (9,2,1)
  12: (7,4,1)
  12: (6,3,2,1)
  13: (8,4,1)
  13: (6,4,2,1)
  14: (8,3,2,1)
  14: (7,4,2,1)
  15: (12,2,1)
  15: (9,3,2,1)
  15: (8,4,2,1)
  15: (5,4,3,2,1)
An example for n = 6 is (20,18,11,5,3,2,1), with prime indices:
  20: {1,1,3}
  18: {1,2,2}
  11: {5}
   5: {3}
   3: {2}
   2: {1}
   1: {}
All of these prime indices {1,2,3,5} belong to the partition, as required.

The subset version is A324736. The non-strict version is A324753. The Heinz number version is A290822. An infinite version is A324698.
Cf. A000720, A001462, A007097, A074971, A078374, A112798, A276625, A279861, A290689, A290760, A305713.
Cf. A324697, A324737, A324751.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&SubsetQ[#,PrimePi/@First/@Join@@FactorInteger/@DeleteCases[#,1]]&]],{n,0,30}]

A324755 Number of integer partitions of n not containing 1 or any part whose prime indices all belong to the partition.

Original entry on oeis.org

1, 0, 1, 1, 2, 1, 4, 3, 5, 6, 10, 7, 16, 14, 23, 23, 35, 34, 53, 54, 75, 80, 112, 115, 160, 169, 223, 244, 315, 339, 442, 478, 604, 664, 832, 910, 1131, 1245, 1524, 1689, 2054, 2263, 2743, 3039, 3634, 4042, 4809, 5343, 6326, 7035, 8276, 9217, 10795, 12011

Offset: 0

Gus Wiseman, Mar 16 2019

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.

For example, (6,2) is such a partition because the prime indices of 6 are {1,2}, which do not all belong to the partition. On the other hand, (5,3) is not such a partition because the prime indices of 5 are {3}, and 3 belongs to the partition.

			The a(2) = 1 through a(10) = 10 integer partitions (A = 10):
  (2)  (3)  (4)   (5)  (6)    (7)   (8)     (9)    (A)
            (22)       (33)   (43)  (44)    (54)   (55)
                       (42)   (52)  (62)    (63)   (64)
                       (222)        (422)   (72)   (73)
                                    (2222)  (333)  (82)
                                            (522)  (433)
                                                   (442)
                                                   (622)
                                                   (4222)
                                                   (22222)

The subset version is A324739, with maximal case A324762. The strict case is A324750. The Heinz number version is A324760. An infinite version is A324694.

Cf. A000837, A001462, A051424, A112798, A276625, A290822, A304360, A306844, A324695, A324696, A324744.

Table[Length[Select[IntegerPartitions[n],!MemberQ[#,k_/;SubsetQ[#,PrimePi/@First/@If[k==1,{},FactorInteger[k]]]]&]],{n,0,30}]

A332273 Sizes of maximal weakly decreasing subsequences of A000002.

Original entry on oeis.org

1, 4, 2, 3, 4, 3, 3, 3, 2, 4, 3, 2, 3, 4, 2, 3, 3, 3, 3, 4, 2, 3, 4, 3, 2, 3, 3, 3, 4, 2, 3, 4, 3, 3, 3, 2, 3, 4, 3, 2, 4, 3, 3, 3, 3, 3, 4, 2, 3, 3, 3, 3, 3, 3, 3, 4, 2, 3, 3, 3, 3, 3, 2, 4, 3, 2, 3, 3, 3, 4, 2, 3, 4, 3, 2, 4, 3, 3, 3, 3, 2, 4, 3, 3, 3, 3, 3

Offset: 1

Gus Wiseman, Mar 08 2020

nonn

			The weakly decreasing subsequences begin: (1), (2,2,1,1), (2,1), (2,2,1), (2,2,1,1), (2,1,1), (2,2,1), (2,1,1), (2,1), (2,2,1,1), (2,1,1), (2,1), (2,2,1), (2,2,1,1).

The number of runs in the first n terms of A000002 is A156253.
The weakly increasing version is A332875.
Cf. A000002, A001462, A013947, A013948, A088568, A288605, A296658, A329315, A329316, A329317, A329362.

kolagrow[q_]:=If[Length[q]<2,Take[{1,2},Length[q]+1],Append[q,Switch[{q[[Length[Split[q]]]],q[[-2]],Last[q]},{1,1,1},0,{1,1,2},1,{1,2,1},2,{1,2,2},0,{2,1,1},2,{2,1,2},2,{2,2,1},1,{2,2,2},1]]]
kol[n_Integer]:=Nest[kolagrow,{1},n-1];
Length/@Split[kol[40],#1>=#2&]

a(n) = A000002(2*n - 2) + A000002(2*n - 1) for n > 1.

A332296 Number of narrowly totally normal compositions of n.

Original entry on oeis.org

1, 1, 2, 4, 5, 7, 13, 23, 30, 63, 120, 209, 369, 651, 1198, 2174, 3896, 7023, 12699, 22941, 41565

Offset: 0

Gus Wiseman, Feb 15 2020

A sequence is narrowly totally normal if either it is empty, a singleton (narrow), or it covers an initial interval of positive integers (normal) with narrowly totally normal run-lengths.

A composition of n is a finite sequence of positive integers summing to n.

			The a(0) = 1 through a(6) = 13 compositions:
  ()  (1)  (2)   (3)    (4)     (5)      (6)
           (11)  (12)   (112)   (122)    (123)
                 (21)   (121)   (212)    (132)
                 (111)  (211)   (221)    (213)
                        (1111)  (1121)   (231)
                                (1211)   (312)
                                (11111)  (321)
                                         (1212)
                                         (1221)
                                         (2112)
                                         (2121)
                                         (11211)
                                         (111111)
For example, starting with the composition (1,1,2,3,1,1) and repeatedly taking run-lengths gives (1,1,2,3,1,1) -> (2,1,1,2) -> (1,2,1) -> (1,1,1) -> (3). The first four are normal and the last is a singleton, so (1,1,2,3,1,1) is counted under a(9).

Normal compositions are A107429.
The wide version is A332279.
The wide recursive version (for partitions) is A332295.
The alternating version is A332296 (this sequence).
The strong version is A332336.
The co-strong version is (also) A332336.
Cf. A001462, A316496, A317081, A317245, A317491, A329744, A332276, A332277, A332278, A332297, A332337, A332340.

tinQ[q_]:=Or[Length[q]<=1,And[Union[q]==Range[Max[q]],tinQ[Length/@Split[q]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],tinQ]],{n,0,10}]

For n > 1, a(n) = A332279(n) + 1.

A332338 Number of alternately co-strong compositions of n.

Original entry on oeis.org

1, 1, 2, 4, 7, 12, 24, 39, 72, 125, 224, 387, 697, 1205, 2141, 3736, 6598, 11516, 20331, 35526, 62507, 109436, 192200, 336533, 590582, 1034187

Offset: 0

Gus Wiseman, Feb 17 2020

A sequence is alternately co-strong if either it is empty, equal to (1), or its run-lengths are weakly increasing (co-strong) and, when reversed, are themselves an alternately co-strong sequence.

			The a(1) = 1 through a(5) = 12 compositions:
  (1)  (2)   (3)    (4)     (5)
       (11)  (12)   (13)    (14)
             (21)   (22)    (23)
             (111)  (31)    (32)
                    (112)   (41)
                    (121)   (113)
                    (1111)  (131)
                            (212)
                            (221)
                            (1112)
                            (1121)
                            (11111)
For example, starting with the composition y = (1,6,2,2,1,1,1,1) and repeatedly taking run-lengths and reversing gives (1,6,2,2,1,1,1,1) -> (4,2,1,1) -> (2,1,1) -> (2,1) -> (1,1) -> (2). All of these have weakly increasing run-lengths and the last is a singleton, so y is counted under a(15).

The case of partitions is A317256.
The recursive (rather than alternating) version is A332274.
The total (rather than alternating) version is (also) A332274.
The strong version is this same sequence.
The case of reversed partitions is A332339.
The normal version is A332340(n) + 1 for n > 1.
Cf. A001462, A100883, A181819, A182850, A316496, A317257, A329744, A329746, A332275, A332292, A332296.

tniQ[q_]:=Or[q=={},q=={1},And[LessEqual@@Length/@Split[q],tniQ[Reverse[Length/@Split[q]]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],tniQ]],{n,0,10}]

A281579 Lexicographically earliest sequence such that, for any n>0, a(n)=length of the n-th run of consecutive terms in arithmetic progression in this sequence.

Original entry on oeis.org

2, 2, 3, 3, 3, 4, 5, 4, 3, 3, 3, 3, 4, 5, 6, 7, 6, 5, 4, 4, 4, 3, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 4, 4, 4, 5, 6, 7, 6, 5, 4, 4, 4, 2, 2, 3, 3, 3, 4, 5, 6, 5, 4, 3, 3, 3, 3, 4, 5, 6, 5, 4, 3, 2, 2

Offset: 1

Rémy Sigrist, Jan 29 2017

nonn

Runs of consecutive terms in arithmetic progression overlap: the last term of the n-th run corresponds to the first term of the (n+1)-st run.
See A281772 for the common difference of the n-th run of consecutive terms in arithmetic progression.
See A281783 for the index of the first term of the n-th run of consecutive terms in arithmetic progression.
See A281900 for the index of the first occurrence of n in the sequence.
We can show that:
1) a(n)>=2 for any n>0,
2) a(n+1)<=a(n)+1 for any n>0,
3) runs of consecutive 2's have at least length 2.
Conjectures:
4) there are infinitely many runs of consecutive 2's,
5) the sequence is unbounded.
This sequence has connections with the Kolakoski sequence (A000002) and Golomb's sequence (A001462) in the sense that they all establish a link between their terms and the lengths of inner runs.
This sequence has similarities with A113138. - Rémy Sigrist, Feb 08 2017
A380317 is an essentially identical sequence. - N. J. A. Sloane, Feb 17 2025

			a(1)=2 fits the definition (and a(1)=1 would not, because whatever a(2) is, (a(1),a(2)) is an arithmetic progression of length 2).
a(2)=2 also fits the definition.
(a(1), a(2)) constitutes the first run, and has length a(1)=2.
a(3) cannot equal 2 (as it would extend the previous run).
a(3)=3 fits the definition.
(a(2),a(3)) constitutes the second run, and has length a(2)=2.
a(4) cannot equal 2 (as a(5) would be equal to 1, which is impossible).
a(4)=3 fits the definition.
We complete the 3rd run with a(5)=3.

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, PARI program for A281579

Cf. A000002, A001462, A113138, A281772, A281783, A281900, A380317.

A324737 Number of subsets of {2...n} containing every element of {2...n} whose prime indices all belong to the subset.

Original entry on oeis.org

1, 2, 3, 6, 8, 16, 24, 48, 84, 168, 216, 432, 648, 1296, 2448, 4896, 6528, 13056, 19584, 39168, 77760, 155520, 229248, 458496, 790272, 1580544, 3128832, 6257664, 9386496, 18772992, 24081408, 48162816, 95938560, 191877120, 378335232, 756670464, 1135005696, 2270011392

Offset: 1

Gus Wiseman, Mar 13 2019

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.

Also the number of subsets of {2...n} with complement containing no term whose prime indices all belong to the subset.

			The a(1) = 1 through a(6) = 16 subsets:
  {}  {}   {}     {}       {}         {}
      {2}  {3}    {3}      {4}        {4}
           {2,3}  {4}      {5}        {5}
                  {2,3}    {3,5}      {6}
                  {3,4}    {4,5}      {3,5}
                  {2,3,4}  {2,3,5}    {4,5}
                           {3,4,5}    {4,6}
                           {2,3,4,5}  {5,6}
                                      {2,3,5}
                                      {3,4,5}
                                      {3,5,6}
                                      {4,5,6}
                                      {2,3,4,5}
                                      {2,3,5,6}
                                      {3,4,5,6}
                                      {2,3,4,5,6}
An example for n = 15 is {2, 3, 5, 8, 9, 10, 11, 15}. The numbers from 2 to 15 with all prime indices in the subset are {3, 5, 9, 11, 15}, which all belong to the subset, as required.

Andrew Howroyd, Table of n, a(n) for n = 1..100

Cf. A000720, A001221, A001462, A007097, A084422, A085945, A112798, A276625, A290689, A290822, A304360, A306844.

Cf. A324697, A324698, A324736, A324738, A324748, A324753, A324755.

Table[Length[Select[Subsets[Range[2,n]],Function[set,SubsetQ[set,Select[Range[2,n],SubsetQ[set,PrimePi/@First/@FactorInteger[#]]&]]]]],{n,10}]

pset(n)={my(b=0, f=factor(n)[, 1]); sum(i=1, #f, 1<<(primepi(f[i])))}
a(n)={my(p=vector(n-1, k, pset(k+1)>>1), d=0); for(i=1, #p, d=bitor(d, p[i]));
((k, b)->if(k>#p, 1, my(t=self()(k+1, b+(1<Andrew Howroyd, Aug 24 2019

Terms a(21) and beyond from Andrew Howroyd, Aug 24 2019

cp's OEIS Frontend

A332297 Number of narrowly totally strongly normal integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A331784 Lexicographically earliest sequence of positive integers that have at most one prime index already in the sequence, counting multiplicity.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A332275 Number of totally co-strong integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A324748 Number of strict integer partitions of n containing all prime indices of the parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A324755 Number of integer partitions of n not containing 1 or any part whose prime indices all belong to the partition.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A332273 Sizes of maximal weakly decreasing subsequences of A000002.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A332296 Number of narrowly totally normal compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A332338 Number of alternately co-strong compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A281579 Lexicographically earliest sequence such that, for any n>0, a(n)=length of the n-th run of consecutive terms in arithmetic progression in this sequence.

Views

Author

Keywords