A045691
Number of binary words of length n with autocorrelation function 2^(n-1)+1.
Original entry on oeis.org
0, 1, 1, 3, 5, 11, 19, 41, 77, 159, 307, 625, 1231, 2481, 4921, 9883, 19689, 39455, 78751, 157661, 315015, 630337, 1260049, 2520723, 5040215, 10081661, 20160841, 40324163, 80643405, 161291731, 322573579, 645157041, 1290294393, 2580608475, 5161177495
Offset: 0
Torsten Sillke (torsten.sillke(AT)lhsystems.com)
If a(n) counts subsets of {1..n} with n and without adjacent quotients 1/2:
- The version with quotients >= 1/2 is
A045690(n+1), partitions
A342094.
- Strict partitions of this type are counted by
A350840.
- For differences instead of quotients we have
A350842, strict
A350844.
- Partitions not of this type are counted by
A350846, ranked by
A350845.
A000740 = relatively prime subsets of {1..n} containing n.
A002843 = compositions with all adjacent quotients >= 1/2.
A050291 = double-free subsets of {1..n}.
A154402 = partitions with all adjacent quotients 2.
A308546 = double-closed subsets of {1..n}, with maximum: shifted right.
A326115 = maximal double-free subsets of {1..n}.
Cf.
A000009,
A001511,
A003000,
A003114,
A116932,
A274199,
A323093,
A342095,
A342191,
A342331,
A342332,
A342333,
A342337.
-
Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&And@@Table[#[[i-1]]/#[[i]]!=1/2,{i,2,Length[#]}]&]],{n,0,15}] (* Gus Wiseman, Jan 22 2022 *)
A350845
Heinz numbers of integer partitions with at least two adjacent parts of quotient 2.
Original entry on oeis.org
6, 12, 18, 21, 24, 30, 36, 42, 48, 54, 60, 63, 65, 66, 72, 78, 84, 90, 96, 102, 108, 114, 120, 126, 130, 132, 133, 138, 144, 147, 150, 156, 162, 168, 174, 180, 186, 189, 192, 195, 198, 204, 210, 216, 222, 228, 231, 234, 240, 246, 252, 258, 260, 264, 266, 270
Offset: 1
The terms and corresponding partitions begin:
6: (2,1)
12: (2,1,1)
18: (2,2,1)
21: (4,2)
24: (2,1,1,1)
30: (3,2,1)
36: (2,2,1,1)
42: (4,2,1)
48: (2,1,1,1,1)
54: (2,2,2,1)
60: (3,2,1,1)
63: (4,2,2)
65: (6,3)
66: (5,2,1)
72: (2,2,1,1,1)
78: (6,2,1)
84: (4,2,1,1)
90: (3,2,2,1)
96: (2,1,1,1,1,1)
The strict complement is counted by
A350840.
These partitions are counted by
A350846.
A000045 = sets containing n with all differences > 2.
A325160 ranks strict partitions with no successions, counted by
A003114.
Cf.
A000929,
A001105,
A018819,
A045690,
A045691,
A094537,
A154402,
A319613,
A323093,
A337135,
A342094,
A342095,
A342098,
A342191.
-
primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],MemberQ[Divide@@@Partition[primeptn[#],2,1],2]&]
Comments