login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A318619 a(0) = 0, a(1) = 1; for n > 1, a(n) = Sum_{k=0..n-2} a(k) XOR a(n-k-2). 0
0, 1, 0, 2, 0, 6, 6, 18, 26, 66, 110, 242, 450, 922, 1826, 3674, 7290, 14586, 29178, 58410, 116538, 233258, 466114, 932426, 1864586, 3729274, 7457386, 14915578, 29828762, 59659322, 119313866, 238631866, 477253498, 954516442, 1909012410, 3818036378, 7636034202 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..36.

N. J. A. Sloane, Transforms

Eric Weisstein's World of Mathematics, XOR

FORMULA

a(n) ~ c * 2^n, where c = 0.111118791917413048987034558666...

MAPLE

a:= proc(n) option remember; `if`(n<2, n,

      add(Bits[Xor](a(k), a(n-k-2)), k=0..n-2))

    end:

seq(a(n), n=0..40); # Alois P. Heinz, Aug 30 2018

MATHEMATICA

a[0] = 0; a[1] = 1; a[n_] := a[n] = Sum[BitXor[a[k], a[n - k - 2]], {k, 0, n - 2}]; Table[a[n], {n, 0, 36}]

CROSSREFS

Cf. A007462, A192484.

Sequence in context: A059444 A328473 A268656 * A340484 A341930 A220608

Adjacent sequences:  A318616 A318617 A318618 * A318620 A318621 A318622

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Aug 30 2018

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 December 3 11:58 EST 2021. Contains 349462 sequences. (Running on oeis4.)