A154402 -id:A154402 - cp's OEIS frontend

A342340 Number of compositions of n where each part after the first is either twice, half, or equal to the prior part.

1, 1, 2, 4, 6, 9, 17, 24, 41, 67, 109, 173, 296, 469, 781, 1284, 2109, 3450, 5713, 9349, 15422, 25351, 41720, 68590, 112982, 185753, 305752, 503041, 827819, 1361940, 2241435, 3687742, 6068537, 9985389, 16431144, 27036576, 44489533, 73205429, 120460062, 198214516, 326161107

Offset: 0

Gus Wiseman, Mar 12 2021

nonn

			The a(1) = 1 through a(6) = 17 compositions:
  (1)  (2)   (3)    (4)     (5)      (6)
       (11)  (12)   (22)    (122)    (24)
             (21)   (112)   (212)    (33)
             (111)  (121)   (221)    (42)
                    (211)   (1112)   (222)
                    (1111)  (1121)   (1122)
                            (1211)   (1212)
                            (2111)   (1221)
                            (11111)  (2112)
                                     (2121)
                                     (2211)
                                     (11112)
                                     (11121)
                                     (11211)
                                     (12111)
                                     (21111)
                                     (111111)

Alois P. Heinz, Table of n, a(n) for n = 0..4623 (first 1001 terms from Andrew Howroyd)

The case of partitions is A342337.
The anti-run version is A342331.
A000929 counts partitions with adjacent parts x >= 2y.
A002843 counts compositions with adjacent parts x <= 2y.
A154402 counts partitions with adjacent parts x = 2y.
A224957 counts compositions with x <= 2y and y <= 2x (strict: A342342).
A274199 counts compositions with adjacent parts x < 2y.
A342094 counts partitions with adjacent x <= 2y (strict: A342095).
A342096 counts partitions without adjacent x >= 2y (strict: A342097).
A342098 counts partitions with adjacent parts x > 2y.
A342330 counts compositions with x < 2y and y < 2x (strict: A342341).
A342332 counts compositions with adjacent parts x > 2y or y > 2x.
A342333 counts compositions with adjacent parts x >= 2y or y >= 2x.
A342334 counts compositions with adjacent parts x >= 2y or y > 2x.
A342335 counts compositions with adjacent parts x >= 2y or y = 2x.
A342338 counts compositions with adjacent parts x < 2y and y <= 2x.
Cf. A000005, A003114, A003242, A034296, A167606, A342083, A342084, A342087, A342191, A342336, A342339.

b:= proc(n, i) option remember; `if`(n=0, 1, add(
      b(n-j, j), j=`if`(i=0, {$1..n}, select(x->
       x::integer and x<=n, {i/2, i, 2*i}))))
    end:
a:= n-> b(n, 0):
seq(a(n), n=0..42);  # Alois P. Heinz, May 24 2021

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],And@@Table[#[[i]]==#[[i-1]]||#[[i]]==2*#[[i-1]]||#[[i-1]]==2*#[[i]],{i,2,Length[#]}]&]],{n,0,15}]
(* Second program: *)
b[n_, i_] := b[n, i] = If[n == 0, 1, Sum[b[n - j, j], {j, If[i == 0, Range[n], Select[ {i/2, i, 2 i}, IntegerQ[#] && # <= n &]]}]];
a[n_] := b[n, 0];
a /@ Range[0, 42] (* Jean-François Alcover, Jun 10 2021, after Alois P. Heinz *)

seq(n)={my(M=matid(n)); for(k=1, n, for(i=1, k-1, M[i, k] = if(i%2==0, M[i/2,k-i]) + if(i*2<=k, M[i,k-i]) + if(i*3<=k, M[i*2,k-i]))); concat([1], sum(q=1, n, M[q, ]))} \\ Andrew Howroyd, Mar 13 2021

Terms a(21) and beyond from Andrew Howroyd, Mar 13 2021

A342341 Number of strict compositions of n with all adjacent parts (x, y) satisfying x < 2y and y < 2x.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 3, 3, 5, 5, 5, 9, 7, 13, 15, 17, 19, 29, 31, 39, 43, 63, 59, 75, 121, 119, 169, 167, 199, 279, 305, 343, 479, 537, 733, 789, 883, 1057, 1421, 1545, 1831, 2409, 2577, 3343, 4001, 4657, 5131, 6065, 7755, 8841, 10473, 12995, 14659, 17671, 20619, 25157, 28255, 33131, 38265, 47699, 53171, 62611, 80005, 88519, 105937, 119989

Offset: 0

Gus Wiseman, Mar 12 2021

nonn

Each quotient of adjacent parts is between 1/2 and 2 exclusive.

			The a(1) = 1 through a(17) = 17 compositions (A..G = 10..16):
  1  2  3  4  5   6  7   8   9    A    B   C    D    E     F     G
              23     34  35  45   46   47  57   58   59    69    6A
              32     43  53  54   64   56  75   67   68    78    79
                             234  235  65  345  76   86    87    97
                             432  532  74  354  85   95    96    A6
                                           435  346  347   357   358
                                           453  643  356   456   457
                                           534       653   465   475
                                           543       743   546   547
                                                     2345  564   574
                                                     2354  645   745
                                                     4532  654   754
                                                     5432  753   853
                                                           2346  2347
                                                           6432  2356
                                                                 6532
                                                                 7432

Bert Dobbelaere, Table of n, a(n) for n = 0..100

The unordered version (partitions) is A342097 (non-strict: A342096).
The non-strict version is A342330.
The version allowing equality is A342342 (non-strict: A224957).
A000929 counts partitions with adjacent parts x >= 2y.
A002843 counts compositions with adjacent parts x <= 2y.
A154402 counts partitions with adjacent parts x = 2y.
A274199 counts compositions with adjacent parts x < 2y.
A342094 counts partitions with adjacent x <= 2y (strict: A342095).
A342098 counts partitions with adjacent parts x > 2y.
A342331 counts compositions with adjacent parts x = 2y or y = 2x.
A342332 counts compositions with adjacent parts x > 2y or y > 2x.
A342333 counts compositions with adjacent parts x >= 2y or y >= 2x.
A342335 counts compositions with adjacent parts x >= 2y or y = 2x.
A342337 counts partitions with adjacent parts x = y or x = 2y.
A342338 counts compositions with adjacent parts x < 2y and y <= 2x.
Cf. A003114, A003242, A034296, A167606, A342083, A342084, A342087, A342191, A342334, A342336, A342339, A342340.

Table[Length[Select[Join@@Permutations/@Select[IntegerPartitions[n],UnsameQ@@#&],And@@Table[#[[i]]<2*#[[i-1]]&&#[[i-1]]<2*#[[i]],{i,2,Length[#]}]&]],{n,0,15}]

More terms from Bert Dobbelaere, Mar 19 2021

A342334 Number of compositions of n with all adjacent parts (x, y) satisfying x >= 2y or y > 2x.

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 6, 11, 16, 23, 35, 54, 82, 125, 193, 294, 447, 680, 1037, 1580, 2408, 3676, 5606, 8544, 13024, 19860, 30277, 46155, 70374, 107300, 163586, 249397, 380235, 579705, 883810, 1347467, 2054371, 3132102, 4775211, 7280321, 11099613, 16922503, 25800136, 39335052, 59970425, 91431195

Offset: 0

Gus Wiseman, Mar 10 2021

nonn

Also the number of compositions of n with all adjacent parts (x, y) satisfying x > 2y or y >= 2x.

			The a(1) = 1 through a(8) = 16 compositions:
  (1)  (2)  (3)   (4)   (5)    (6)    (7)     (8)
            (12)  (13)  (14)   (15)   (16)    (17)
                  (31)  (41)   (24)   (25)    (26)
                        (131)  (51)   (52)    (62)
                               (141)  (61)    (71)
                               (312)  (124)   (125)
                                      (151)   (152)
                                      (241)   (161)
                                      (313)   (251)
                                      (412)   (314)
                                      (1312)  (413)
                                              (512)
                                              (1241)
                                              (1313)
                                              (1412)
                                              (3131)

The unordered version (partitions) is A342098 or A000929 (multisets).
The version not allowing equality (i.e., strict relations) is A342332.
The version allowing equality (i.e., non-strict relations) is A342333.
Reversing operators and changing 'or' into 'and' gives A342338.
A002843 counts compositions with adjacent parts x <= 2y.
A154402 counts partitions with adjacent parts x = 2y.
A224957 counts compositions with x <= 2y and y <= 2x (strict: A342342).
A274199 counts compositions with adjacent parts x < 2y.
A342094 counts partitions with adjacent parts x <= 2y (strict: A342095).
A342096 counts partitions without adjacent x >= 2y (strict: A342097).
A342330 counts compositions with x < 2y and y < 2x (strict: A342341).
A342331 counts compositions with adjacent parts x = 2y or y = 2x.
A342335 counts compositions with adjacent parts x >= 2y or y = 2x.
A342337 counts partitions with adjacent parts x = y or x = 2y.
Cf. A003114, A003242, A034296, A167606, A342083, A342084, A342087, A342191, A342336, A342340.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],And@@Table[#[[i]]>=2*#[[i-1]]||#[[i-1]]>2*#[[i]],{i,2,Length[#]}]&]],{n,0,15}]

More terms from Joerg Arndt, Mar 12 2021

A342342 Number of strict compositions of n with all adjacent parts (x, y) satisfying x <= 2y and y <= 2x.

Original entry on oeis.org

1, 1, 1, 3, 1, 3, 5, 5, 3, 11, 9, 11, 17, 15, 29, 39, 31, 39, 65, 57, 107, 127, 149, 155, 187, 265, 293, 419, 523, 571, 781, 763, 941, 1371, 1387, 2125, 2383, 2775, 3243, 4189, 4555, 5349, 7241, 7997, 10591, 13171, 14581, 17213, 20253, 25177, 27701, 34317

Offset: 0

Gus Wiseman, Mar 12 2021

nonn

Each quotient of adjacent parts is between 1/2 and 2 inclusive.

			The a(1) = 1 through a(12) = 17 strict compositions (A = 10, B = 11, C = 12):
  1   2   3    4   5    6     7     8    9     A      B      C
          12       23   24    34    35   36    46     47     48
          21       32   42    43    53   45    64     56     57
                        123   124        54    235    65     75
                        321   421        63    532    74     84
                                         234   1234   236    246
                                         243   1243   245    345
                                         324   3421   542    354
                                         342   4321   632    435
                                         423          1235   453
                                         432          5321   534
                                                             543
                                                             642
                                                             1236
                                                             1245
                                                             5421
                                                             6321

The non-strict version is A224957.
The case with strict relations is A342341 (non-strict: A342330).
A000929 counts partitions with adjacent parts x >= 2y.
A002843 counts compositions with adjacent parts x <= 2y.
A154402 counts partitions with adjacent parts x = 2y.
A274199 counts compositions with adjacent parts x < 2y.
A342094 counts partitions with adjacent x <= 2y (strict: A342095).
A342096 counts partitions without adjacent x >= 2y (strict: A342097).
A342098 counts partitions with adjacent parts x > 2y.
A342331 counts compositions with adjacent parts x = 2y or y = 2x.
A342332 counts compositions with adjacent parts x > 2y or y > 2x.
A342333 counts compositions with adjacent parts x >= 2y or y >= 2x.
A342335 counts compositions with adjacent parts x >= 2y or y = 2x.
A342337 counts partitions with adjacent parts x = y or x = 2y.
A342338 counts compositions with adjacent parts x < 2y and y <= 2x.
Cf. A003114, A003242, A034296, A167606, A342083, A342084, A342087, A342191, A342334, A342336, A342340.

Table[Length[Select[Join@@Permutations/@Select[IntegerPartitions[n],UnsameQ@@#&],And@@Table[#[[i]]<=2*#[[i-1]]&&#[[i-1]]<=2*#[[i]],{i,2,Length[#]}]&]],{n,0,15}]

a(40)-a(51) from Alois P. Heinz, May 24 2021

A350837 Number of integer partitions of n with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 1, 2, 2, 4, 5, 7, 10, 14, 18, 24, 31, 41, 53, 70, 87, 112, 140, 178, 221, 277, 344, 428, 526, 648, 792, 971, 1180, 1436, 1738, 2103, 2533, 3049, 3660, 4387, 5242, 6259, 7450, 8860, 10511, 12453, 14723, 17387, 20489, 24121, 28343, 33269, 38982, 45632, 53327

Offset: 0

Gus Wiseman, Jan 18 2022

nonn

The first of these partitions that is not double-free (see A323092 for definition) is (4,3,2).

			The a(1) = 1 through a(7) = 10 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (111)  (22)    (32)     (33)      (43)
                    (31)    (41)     (51)      (52)
                    (1111)  (311)    (222)     (61)
                            (11111)  (411)     (322)
                                     (3111)    (331)
                                     (111111)  (511)
                                               (4111)
                                               (31111)
                                               (1111111)

Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

The version with quotients >= 2 is A000929, sets A018819.
                           <= 2 is A342094, ranked by A342191.
                           < 2 is A342096, sets A045690, strict A342097.
                           > 2 is A342098, sets A040039.
The sets version (subsets of prescribed maximum) is A045691.
These partitions are ranked by A350838.
The strict case is A350840.
A version for differences is A350842, strict A350844.
The complement is counted by A350846, ranked by A350845.
A000041 = integer partitions.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free partitions, ranked by A320340.
Cf. A000070, A003000, A003114, `A003242, A051424, `A101417, A120641, A154402, A305148, A323093, A323094, A342095, A350839.

Table[Length[Select[IntegerPartitions[n], FreeQ[Divide@@@Partition[#,2,1],2]&]],{n,0,15}]

A350838 Heinz numbers of partitions with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 64, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83

Offset: 1

Gus Wiseman, Jan 18 2022

nonn

Differs from A320340 in having 105: (4,3,2), 315: (4,3,2,2), 455: (6,4,3), etc.

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are numbers with no adjacent prime indices of quotient 1/2.

			The terms and their prime indices begin:
      1: {}            19: {8}             38: {1,8}
      2: {1}           20: {1,1,3}         39: {2,6}
      3: {2}           22: {1,5}           40: {1,1,1,3}
      4: {1,1}         23: {9}             41: {13}
      5: {3}           25: {3,3}           43: {14}
      7: {4}           26: {1,6}           44: {1,1,5}
      8: {1,1,1}       27: {2,2,2}         45: {2,2,3}
      9: {2,2}         28: {1,1,4}         46: {1,9}
     10: {1,3}         29: {10}            47: {15}
     11: {5}           31: {11}            49: {4,4}
     13: {6}           32: {1,1,1,1,1}     50: {1,3,3}
     14: {1,4}         33: {2,5}           51: {2,7}
     15: {2,3}         34: {1,7}           52: {1,1,6}
     16: {1,1,1,1}     35: {3,4}           53: {16}
     17: {7}           37: {12}            55: {3,5}

The version with quotients >= 2 is counted by A000929, sets A018819.
                           <= 2 is A342191, counted by A342094.
                           < 2 is counted by A342096, sets A045690.
                           > 2 is counted by A342098, sets A040039.
The sets version (subsets of prescribed maximum) is counted by A045691.
These partitions are counted by A350837.
The strict case is counted by A350840.
For differences instead of quotients we have A350842, strict A350844.
The complement is A350845, counted by A350846.
A000041 = integer partitions.
A000045 = sets containing n with all differences > 2.
A003114 = strict partitions with no successions, ranked by A325160.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free integer partitions, ranked by A320340.
A350839 = partitions with gaps and conjugate gaps, ranked by A350841.
Cf. A000302, A001105, A003000, A018819, A094537, A120641, A154402, A319613, A323093, A337135, A342097, A342095.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],And@@Table[FreeQ[Divide@@@Partition[primeptn[#],2,1],2],{i,2,PrimeOmega[#]}]&]

A342515 Number of strict partitions of n with constant (equal) first-quotients.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 3, 5, 4, 5, 5, 6, 6, 8, 8, 9, 8, 9, 9, 11, 10, 13, 11, 12, 12, 13, 14, 14, 15, 15, 16, 18, 16, 17, 17, 19, 18, 20, 20, 22, 21, 21, 23, 23, 22, 24, 23, 24, 24, 27, 25, 26, 27, 27, 27, 28, 29, 31, 29, 30, 31, 32, 33, 35, 32, 35, 33, 35, 34, 35

Offset: 0

Gus Wiseman, Mar 19 2021

nonn

Also the number of reversed strict partitions of n with constant (equal) first-quotients.

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the quotients of (6,3,1) are (1/2,1/3).

			The a(1) = 1 through a(15) = 9 partitions (A..F = 10..15):
  1   2   3    4    5    6    7     8    9    A    B    C    D     E     F
          21   31   32   42   43    53   54   64   65   75   76    86    87
                    41   51   52    62   63   73   74   84   85    95    96
                              61    71   72   82   83   93   94    A4    A5
                              421        81   91   92   A2   A3    B3    B4
                                                   A1   B1   B2    C2    C3
                                                             C1    D1    D2
                                                             931   842   E1
                                                                         8421

Wikipedia, Arithmetic progression
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.
Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

The version for differences instead of quotients is A049980.
The non-strict ordered version is A342495.
The non-strict version is A342496.
The distinct instead of equal version is A342520.
A000005 counts constant partitions.
A000041 counts partitions (strict: A000009).
A001055 counts factorizations (strict: A045778, ordered: A074206).
A003238 counts chains of divisors summing to n - 1 (strict: A122651).
A154402 counts partitions with adjacent parts x = 2y.
A167865 counts strict chains of divisors > 1 summing to n.
A175342 counts compositions with equal differences.
Cf. A003242, A005117, A049988, A057567, A067824, A253249, A307824, A318991, A318992, A325328, A342086.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&SameQ@@Divide@@@Partition[#,2,1]&]],{n,0,30}]

A350840 Number of strict integer partitions of n with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 2, 4, 5, 6, 7, 8, 10, 13, 17, 19, 22, 25, 30, 35, 43, 52, 60, 70, 81, 93, 106, 122, 142, 166, 190, 216, 249, 287, 325, 371, 420, 479, 543, 617, 695, 784, 888, 1000, 1126, 1266, 1420, 1594, 1792, 2008, 2247, 2514, 2809, 3135, 3496, 3891, 4332

Offset: 0

Gus Wiseman, Jan 20 2022

nonn

			The a(1) = 1 through a(13) = 13 partitions (A..D = 10..13):
  1   2   3   4    5    6    7    8     9     A     B     C     D
              31   32   51   43   53    54    64    65    75    76
                   41        52   62    72    73    74    93    85
                             61   71    81    82    83    A2    94
                                  431   432   91    92    B1    A3
                                        531   532   A1    543   B2
                                              541   641   651   C1
                                                    731   732   643
                                                          741   652
                                                          831   751
                                                                832
                                                                931
                                                                5431

The version for subsets of prescribed maximum is A045691.
The double-free case is A120641.
The non-strict case is A350837, ranked by A350838.
An additive version (differences) is A350844, non-strict A350842.
The non-strict complement is counted by A350846, ranked by A350845.
Versions for prescribed quotients:
  = 2:  A154402, sets A001511.
  != 2: A350840 (this sequence), sets A045691.
  >= 2: A000929, sets A018819.
  <= 2: A342095, non-strict A342094.
  < 2:  A342097, non-strict A342096, sets A045690.
  > 2:  A342098, sets A040039.
A000041 = integer partitions.
A000045 = sets containing n with all differences > 2.
A003114 = strict partitions with no successions, ranked by A325160.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free integer partitions, ranked by A320340.
A350839 = partitions with gaps and conjugate gaps, ranked by A350841.
Cf. A003000, A018819, A303362, A323093, A323094, A337135, A342191.

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

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)

nonn

From Gus Wiseman, Jan 22 2022: (Start)
Also the number of subsets of {1..n} containing n but without adjacent elements of quotient 1/2. The Heinz numbers of these sets are a subset of the squarefree terms of A320340. For example, the a(1) = 1 through a(6) = 19 subsets are:
  {1}  {2}  {3}    {4}      {5}        {6}
            {1,3}  {1,4}    {1,5}      {1,6}
            {2,3}  {3,4}    {2,5}      {2,6}
                   {1,3,4}  {3,5}      {4,6}
                   {2,3,4}  {4,5}      {5,6}
                            {1,3,5}    {1,4,6}
                            {1,4,5}    {1,5,6}
                            {2,3,5}    {2,5,6}
                            {3,4,5}    {3,4,6}
                            {1,3,4,5}  {3,5,6}
                            {2,3,4,5}  {4,5,6}
                                       {1,3,4,6}
                                       {1,3,5,6}
                                       {1,4,5,6}
                                       {2,3,4,6}
                                       {2,3,5,6}
                                       {3,4,5,6}
                                       {1,3,4,5,6}
                                       {2,3,4,5,6}
(End)

If a(n) counts subsets of {1..n} with n and without adjacent quotients 1/2:
- The version with quotients <= 1/2 is A018819, partitions A000929.
- The version with quotients < 1/2 is A040039, partitions A342098.
- The version with quotients >= 1/2 is A045690(n+1), partitions A342094.
- The version with quotients > 1/2 is A045690, partitions A342096.
- Partitions of this type are counted by A350837, ranked by A350838.
- 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.
A323092 = double-free integer partitions, ranked by A320340, strict A120641.
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 *)

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

More terms from Sean A. Irvine, Mar 18 2021

A305795 Restricted growth sequence transform of A305794, a filter sequence constructed from the binary expansions of the divisors of n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 13, 14, 15, 5, 16, 11, 17, 18, 19, 20, 21, 22, 19, 23, 24, 20, 25, 26, 27, 28, 10, 29, 30, 31, 19, 32, 33, 31, 34, 35, 36, 37, 38, 39, 40, 41, 42, 23, 36, 35, 43, 44, 45, 32, 38, 46, 47, 39, 48, 49, 50, 51, 52, 11, 17, 53, 54, 20, 55, 31, 56, 57, 36, 58, 59, 39, 60, 61, 56, 35, 62, 63, 64, 65, 66, 35, 67

Offset: 1

Antti Karttunen, Jun 11 2018

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences related to binary expansion of n

Cf. A278222, A286622, A305794.

Cf. also A304105, A305793, A305815.

\\ Needs also code from A286622:
up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A305794(n) = { my(m=1); fordiv(n, d, if(d>1, m *= prime(A286622(d)-1))); (m); };
v305795 = rgs_transform(vector(up_to, n, A305794(n)));
A305795(n) = v305795[n];

For all i, j:
  a(i) = a(j) => A000005(i) = A000005(j).
  a(i) = a(j) => A007814(i) = A007814(j).
  a(i) = a(j) => A093653(i) = A093653(j).
  a(i) = a(j) => A154402(i) = A154402(j).
  a(i) = a(j) => A305436(i) = A305436(j).

cp's OEIS Frontend

A342340 Number of compositions of n where each part after the first is either twice, half, or equal to the prior part.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A342341 Number of strict compositions of n with all adjacent parts (x, y) satisfying x < 2y and y < 2x.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A342334 Number of compositions of n with all adjacent parts (x, y) satisfying x >= 2y or y > 2x.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A342342 Number of strict compositions of n with all adjacent parts (x, y) satisfying x <= 2y and y <= 2x.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A350837 Number of integer partitions of n with no adjacent parts of quotient 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A350838 Heinz numbers of partitions with no adjacent parts of quotient 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A342515 Number of strict partitions of n with constant (equal) first-quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A350840 Number of strict integer partitions of n with no adjacent parts of quotient 2.

Views

Author

Keywords

Examples

Crossrefs

Programs