[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214863 Numbers n such that n XOR 11 = n - 11. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Links to sequences of the form n XOR m = n - m are found below with the value of m specified.
LINKS
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
MATHEMATICA
Select[Range[400], BitXor[#, 11]==#-11&] (* or *) LinearRecurrence[{1, 1, -1}, {11, 15, 27}, 50] (* Harvey P. Dale, Jun 05 2021 *)
PROG
(Magma)
XOR := func<a, b | Seqint([ (adigs[i] + bdigs[i]) mod 2 : i in [1..n]], 2)
where adigs := Intseq(a, 2, n)
where bdigs := Intseq(b, 2, n)
where n := 1 + Ilog2(Max([a, b, 1]))>;
m:=11;
for n in [1 .. 500] do
if (XOR(n, m) eq n-m) then n; end if;
end for;
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.
Sequence in context: A343416 A256498 A054280 * A094766 A009407 A009433
KEYWORD
nonn,easy
AUTHOR
Brad Clardy, Mar 09 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 15:31 EDT 2024. Contains 375517 sequences. (Running on oeis4.)