A353715 a(n) = b(n)+b(n+1), where b is A353709.

1, 3, 6, 12, 11, 19, 28, 44, 49, 23, 46, 104, 69, 15, 58, 113, 79, 142, 161, 51, 86, 77, 43, 54, 92, 107, 167, 156, 90, 102, 61, 155, 226, 109, 157, 242, 354, 277, 63, 234, 449, 279, 126, 233, 387, 286, 125, 481, 410, 63, 357, 456, 143, 87, 240, 171, 95, 372, 419, 207, 348, 433, 231, 334, 313, 183, 462, 840, 531, 63, 492, 961, 543, 254, 992, 783, 127

Offset

0,2

Comments

Created in an attempt to show that every number appears in A353709. For example, if one could show that the present sequence had a subsequence which was divisible by ever-increasing powers of 2, the desired result would follow. See A353724, A353725, A353726, A353727 for more about this topic.

Links

N. J. A. Sloane, Table of n, a(n) for n = 0..16383

Walter Trump, Log-log plot of first 2^24 terms. Green dots (which overwrite the black dots) indicate terms a(n) which are divisible by 64.

Maple

g:= proc() false end: t:= 2:
b:= proc(n) option remember; global t; local k; if n<2 then n
      else for k from t while g(k) or Bits[And](k, b(n-2))>0
      or Bits[And](k, b(n-1))>0 do od; g(k):=true;
      while g(t) do t:=t+1 od; k fi
    end:
a:= n-> b(n)+b(n+1):
seq(a(n), n=0..100);  # Alois P. Heinz, May 09 2022

Mathematica

g[_] = False ; t = 2;
b[n_] := b[n] = Module[{k}, If[n < 2, n,
   For[k = t, g[k] || BitAnd[k, b[n-2]] > 0 ||
   BitAnd[k, b[n-1]] > 0, k++]; g[k] = True;
   While[g[t], t = t+1]; k]];
a[n_] := b[n] + b[n+1];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Jul 07 2022, after Alois P. Heinz *)

Prog

(Python)
from itertools import count, islice
def A353715_gen(): # generator of terms
    s, a, b, c, ab = {0, 1}, 0, 1, 2, 1
    yield 1
    while True:
        for n in count(c):
            if not (n & ab or n in s):
                yield b+n
                a, b = b, n
                ab = a|b
                s.add(n)
                while c in s:
                    c += 1
                break
A353715_list = list(islice(A353715_gen(), 30)) # Chai Wah Wu, May 11 2022

Crossrefs

Cf. A353709, A353724, A353725, A353726, A353727.

Sequence in context: A308727 A268217 A254793 * A182633 A038587 A090553

Adjacent sequences: A353712 A353713 A353714 * A353716 A353717 A353718

Keyword

base,nonn

Author

N. J. A. Sloane, May 09 2022

Status

approved