A351005 -id:A351005 - cp's OEIS frontend

A351594 Number of odd-length integer partitions y of n that are alternately constant, meaning y_i = y_{i+1} for all odd i.

0, 1, 1, 2, 1, 3, 2, 4, 2, 7, 3, 9, 4, 13, 6, 19, 6, 26, 10, 35, 12, 49, 16, 64, 20, 87, 27, 115, 32, 151, 44, 195, 53, 256, 69, 328, 84, 421, 108, 537, 130, 682, 167, 859, 202, 1085, 252, 1354, 305, 1694, 380, 2104, 456, 2609, 564, 3218, 676, 3968, 826, 4863

Offset: 0

Gus Wiseman, Feb 24 2022

nonn

These are partitions with all even run-lengths except for the last, which is odd.

			The a(1) = 1 through a(9) = 7 partitions:
  (1)  (2)  (3)    (4)  (5)      (6)    (7)        (8)    (9)
            (111)       (221)    (222)  (331)      (332)  (333)
                        (11111)         (22111)           (441)
                                        (1111111)         (22221)
                                                          (33111)
                                                          (2211111)
                                                          (111111111)

The ordered version (compositions) is A016116 shifted right once.
All odd-length partitions are counted by A027193.
The opposite version is A117409, even-length A351012, any length A351003.
Replacing equal with unequal relations appears to give:
- any length: A122129
- odd length: A122130
- even length: A351008
- opposite any length: A122135
- opposite odd length: A351595
- opposite even length: A122134
This is the odd-length case of A351004, even-length A035363.
The case that is also strict at even indices is:
- any length: A351005
- odd length: A351593
- even length: A035457
- opposite any length: A351006
- opposite odd length: A053251
- opposite even length: A351007
A reverse version is A096441; see also A349060.
Cf. A000009, A000041, A000070, A000984, A003242, A027383, A053738, A236559, A236914, A350842.

Table[Length[Select[IntegerPartitions[n],OddQ[Length[#]]&&And@@Table[#[[i]]==#[[i+1]],{i,1,Length[#]-1,2}]&]],{n,0,30}]

A351009 Numbers k such that the k-th composition in standard order is a concatenation of distinct twins (x,x).

Original entry on oeis.org

0, 3, 10, 36, 43, 58, 136, 147, 228, 528, 547, 586, 676, 904, 2080, 2115, 2186, 2347, 2362, 2696, 2707, 2788, 3600, 3658, 3748, 8256, 8323, 8458, 8740, 8747, 8762, 9352, 10768, 10787, 11144, 14368, 14474, 14984, 32896, 33027, 33290, 33828, 33835, 33850, 34963

Offset: 1

Gus Wiseman, Feb 03 2022

nonn

The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.

			The terms together with their binary expansions and standard compositions begin:
    0:           0  ()
    3:          11  (1,1)
   10:        1010  (2,2)
   36:      100100  (3,3)
   43:      101011  (2,2,1,1)
   58:      111010  (1,1,2,2)
  136:    10001000  (4,4)
  147:    10010011  (3,3,1,1)
  228:    11100100  (1,1,3,3)
  528:  1000010000  (5,5)
  547:  1000100011  (4,4,1,1)
  586:  1001001010  (3,3,2,2)
  676:  1010100100  (2,2,3,3)
  904:  1110001000  (1,1,4,4)

The case of twins (binary weight 2) is A000120.
All terms are evil numbers A001969.
The version for Heinz numbers of partitions is A062503, counted by A035457.
These compositions are counted by A032020 interspersed with 0's.
Taking singles instead of twins gives A349051.
This is the strict (distinct twins) version of A351010 and A351011.
A011782 counts compositions.
A085207 represents concatenation using standard compositions.
A333489 ranks anti-runs, complement A348612.
A345167 ranks alternating compositions, counted by A025047.
A351014 counts distinct runs in standard compositions, see A351015.
Cf. A003242, A027383, A035363, A088218, A106356, A122134, A238279, A344604, A349054, A351005, A351007.
Selected statistics of standard compositions:
- Length is A000120.
- Sum is A070939.
- Heinz number is A333219.
- Number of distinct parts is A334028.
Selected classes of standard compositions:
- Partitions are A114994, strict A333256.
- Multisets are A225620, strict A333255.
- Strict compositions are A233564.
- Constant compositions are A272919.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]], 1],0]]//Reverse;
Select[Range[0,1000], UnsameQ@@Split[stc[#]]&&And@@(#==2&)/@Length/@Split[stc[#]]&]

A357851 Numbers k such that the half-alternating sum of the prime indices of k is 1.

Original entry on oeis.org

2, 8, 18, 32, 45, 50, 72, 98, 105, 128, 162, 180, 200, 231, 242, 275, 288, 338, 392, 420, 429, 450, 455, 512, 578, 648, 663, 720, 722, 800, 833, 882, 924, 935, 968, 969, 1050, 1058, 1100, 1125, 1152, 1235, 1250, 1311, 1352, 1458, 1463, 1568, 1680, 1682, 1716

Offset: 1

Gus Wiseman, Oct 28 2022

nonn

We define the half-alternating sum of a sequence (A, B, C, D, E, F, G, ...) to be A + B - C - D + E + F - G - ...

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 terms together with their prime indices begin:
     2: {1}
     8: {1,1,1}
    18: {1,2,2}
    32: {1,1,1,1,1}
    45: {2,2,3}
    50: {1,3,3}
    72: {1,1,1,2,2}
    98: {1,4,4}
   105: {2,3,4}
   128: {1,1,1,1,1,1,1}
   162: {1,2,2,2,2}
   180: {1,1,2,2,3}
   200: {1,1,1,3,3}

The version for k = 0 is A357631, standard compositions A357625-A357626.
The version for original alternating sum is A001105.
Positions of ones in A357629, reverse A357633.
The skew version for k = 0 is A357632, reverse A357636.
Partitions with these Heinz numbers are counted by A035444, skew A035544.
The reverse version is A357635, k = 0 version A000583.
A056239 adds up prime indices, row sums of A112798.
A316524 gives alternating sum of prime indices, reverse A344616.
A351005 = alternately equal and unequal partitions, compositions A357643.
A351006 = alternately unequal and equal partitions, compositions A357644.
A357641 counts comps w/ half-alt sum 0, even-length A357642.
Cf. A003963, A053251, A055932, A345958, A357621-A357624, A357630, A357634, A357637, A357639, A357640.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
halfats[f_]:=Sum[f[[i]]*(-1)^(1+Ceiling[i/2]),{i,Length[f]}];
Select[Range[1000],halfats[primeMS[#]]==1&]

cp's OEIS Frontend

A351594 Number of odd-length integer partitions y of n that are alternately constant, meaning y_i = y_{i+1} for all odd i.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A351009 Numbers k such that the k-th composition in standard order is a concatenation of distinct twins (x,x).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A357851 Numbers k such that the half-alternating sum of the prime indices of k is 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica