cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A214863 Numbers n such that n XOR 11 = n - 11.

Original entry on oeis.org

11, 15, 27, 31, 43, 47, 59, 63, 75, 79, 91, 95, 107, 111, 123, 127, 139, 143, 155, 159, 171, 175, 187, 191, 203, 207, 219, 223, 235, 239, 251, 255, 267, 271, 283, 287, 299, 303, 315, 319, 331, 335, 347, 351, 363
Offset: 1

Views

Author

Brad Clardy, Mar 09 2013

Keywords

Comments

Links to sequences of the form n XOR m = n - m are found below with the value of m specified.

Crossrefs

Cf. A005408 (m=1), A042964 (m=2), A131098 (m=3), A047566 (m=4), A047550 (m=5), A047589 (m=6), A004771 (m=7), A115419 (m=8), A214865 (m=9), A214864 (m=10), A133894 (m=12), A125169 (m=15).
Cf. also A016825, A168392.

Programs

  • Magma
    XOR := func;
    m:=11;
    for n in [1 .. 500] do
          if (XOR(n, m) eq n-m) then n; end if;
    end for;
  • Mathematica
    Select[Range[400],BitXor[#,11]==#-11&] (* or *) LinearRecurrence[{1,1,-1},{11,15,27},50] (* Harvey P. Dale, Jun 05 2021 *)

Formula

a(n)= 1+8*n-2*(-1)^n.
a(n)=A016825(n) + A168392(n) + for n>0.
G.f. x*(11+4*x+x^2) / ( (1+x)*(x-1)^2 ). - R. J. Mathar, Mar 10 2013
Showing 1-1 of 1 results.