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.
%I A354767 #57 Nov 29 2023 13:08:05
%S A354767 1,2,3,4,6,7,8,10,11,12,14,16,17,18,20,22,23,24,26,27,28,30,32,34,35,
%T A354767 36,38,39,40,42,44,46,47,48,50,51,52,54,56,57,58,60,62,63,64,66,68,70,
%U A354767 71,72,74,75,76,78,80,81,82,84,86,87,88,90,92,94,95,96,98,99,100,102,104,105,106,108,110,111,112,114,116
%N A354767 Indices of terms in A354169 that have Hamming weight 1.
%C A354767 The terms of A354169 only have Hamming weights 0, 1, or 2.
%C A354767 Comment from _N. J. A. Sloane_, Jun 26 2022: (Start)
%C A354767 Taking first differences, then applying the RUNS transform twice gives [1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 13, 1, 1, 1, 13, 1, 1, 1, 29, 1, 1, 1, 29, 1, 1, 1, 61, 1, 1, 1, 61, 1, 1, 1, 125, 1, 1, 1, 125, 1, 1, 1, 253, 1, 1, 1, 253, 1, 1, 1, 509, 1, 1, 1,...].
%C A354767 If the initial terms 1, 1, 1, 1, 5 are replaced by a single 1, this has an obvious regular structure, which can then be analyzed to give a generating function for the sequence. See link below. (End)
%C A354767 For proofs of these statements see De Vlieger et al. (2022). - _N. J. A. Sloane_, Aug 29 2022
%H A354767 N. J. A. Sloane, <a href="/A354767/b354767.txt">Table of n, a(n) for n = 1..3296</a>
%H A354767 Michael De Vlieger, Thomas Scheuerle, Rémy Sigrist, N. J. A. Sloane, and Walter Trump, <a href="http://arxiv.org/abs/2209.04108">The Binary Two-Up Sequence</a>, arXiv:2209.04108 [math.CO], Sep 11 2022.
%H A354767 N. J. A. Sloane, <a href="/A354767/a354767.txt">A conjectured generating function for A354169</a>.
%F A354767 Conjecture from _N. J. A. Sloane_, Jun 30 2022, modified Jul 30 2022: (Start)
%F A354767 We first define a sequence {b(n)} as follows.
%F A354767 Define "fence posts" by F(0) = 1, F(2i+1) = 2^(i+5) - 3 for i >= 0, F(2i) = 3*2^(i+3) - 3 for i >= 1.
%F A354767 The F(i) sequence begins 1, 29, 45, 61, 93, 125, 189, 253, 381, 509, ... (cf. A136252 or A354788).
%F A354767 The value of b(n) at n = F(i) is V(i) = 0 if i = 0, V(i) =(F(i)-7)/2 if i >= 1.
%F A354767 The V(i) sequence begins 0, 11, 19, 27, 43, 59, 91, 123, 187, 251, ...
%F A354767 The first 28 terms are irregular, and we simply define b(n) for F(0) = 1 <= n <= 28 to be the n-th term of
%F A354767 [0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 7, 7, 8, 9, 10, 10, 10, 11, 11].
%F A354767 Assume now that n >= F(1) = 29, and define i and j by F(i) <= n < F(i+1), n = F(i) + j.
%F A354767 Then b(n) = V(i) + f(j), where f(0) ... f(5) are 0,1,2,3,3,3, and for j >= 6, f(j) = 2 + 2*floor((j-2)/4) + epsilon(j), where epsilon(j) is 1 if j==1 mod 4 and is otherwise 0.
%F A354767 The f(i), i >= 0, sequence (A354779) is independent of n (to find b(n) we use only an initial segment of f(n)), and begins:
%F A354767 0, 1, 2, 3, 3, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 9, 10, 10, 10, 11, 12, 12, 12, 13, 14, ...
%F A354767 With b(n) defined in this way, we conjecture that a(n) = b(n) + n. This has been checked for the first 3296 terms.
%F A354767 (End)
%F A354767 The conjecture is now known to be true. - _N. J. A. Sloane_, Aug 29 2022
%Y A354767 Cf. A354169, A354680, A354779, A354788, A354798.
%K A354767 nonn
%O A354767 1,2
%A A354767 _N. J. A. Sloane_, Jun 21 2022