login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214864 Numbers n such that n XOR 10 = n - 10. 3
10, 11, 14, 15, 26, 27, 30, 31, 42, 43, 46, 47, 58, 59, 62, 63, 74, 75, 78, 79, 90, 91, 94, 95, 106, 107, 110, 111, 122, 123, 126, 127, 138, 139, 142, 143, 154, 155, 158, 159, 170, 171, 174, 175, 186, 187, 190, 191, 202 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..49.

Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).

FORMULA

a(n) = 4*n + 6 + (3*(-1)^n+1)/2 + 2*(-1)^((2*n-1+(-1)^n)/4) for n >= 0.

a(n) = A016825(n) + A216178(n-1) for n > 0.

G.f. x*(10+x+3*x^2+x^3+x^4) / ( (1+x)*(1+x^2)*(x-1)^2 ). - R. J. Mathar, Mar 10 2013

Numbers k such that k mod 16 is one of {10, 11, 14, 15}. - Joerg Arndt, Mar 15 2013

a(n) = 16*floor(n/4) + ((n-1) mod 2) + 4*floor(((n-1) mod 4) + 10. - Gary Detlefs, Oct 26 2013

MATHEMATICA

Select[Range[200], BitXor[#, 10] == # - 10 &] (* Alonso del Arte, Oct 26 2013 *)

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:=10;

for n in [1 .. 250] do

if (XOR(n, m) eq n-m) then n; end if;

end for;

CROSSREFS

Cf. A214863, A016825, A216178.

Sequence in context: A095038 A085186 A298365 * A062844 A144980 A261713

Adjacent sequences:  A214861 A214862 A214863 * A214865 A214866 A214867

KEYWORD

nonn

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 01:01 EDT 2019. Contains 323429 sequences. (Running on oeis4.)