The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A318621 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A318621

a(0) = a(1) = 1; for n > 1, a(n) = Sum_{k=0..n-2} a(k) OR a(n-k-2).
(history; published version)

#7 by Bruno Berselli at Fri Aug 31 03:47:37 EDT 2018

STATUS

editing

approved

#6 by Bruno Berselli at Fri Aug 31 03:47:34 EDT 2018

NAME

a(0) = a(1) = 1; for n > 1, a(n) = Sum_{k=0..n-2} a(k) OR a(n-k-2).

STATUS

proposed

editing

#5 by Alois P. Heinz at Thu Aug 30 18:27:07 EDT 2018

STATUS

editing

proposed

#4 by Alois P. Heinz at Thu Aug 30 18:27:05 EDT 2018

MAPLE

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

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

end:

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

STATUS

proposed

editing

#3 by Ilya Gutkovskiy at Thu Aug 30 18:14:56 EDT 2018

STATUS

editing

proposed

#2 by Ilya Gutkovskiy at Thu Aug 30 18:00:13 EDT 2018

NAME

allocated for Ilya Gutkovskiy

a(0) = a(1) = 1; a(n) = Sum_{k=0..n-2} a(k) OR a(n-k-2).

DATA

1, 1, 1, 2, 3, 8, 13, 30, 52, 112, 217, 446, 864, 1750, 3469, 6976, 13892, 27828, 55550, 111158, 222224, 444458, 888747, 1777546, 3554844, 7109666, 14218740, 28437336, 56874024, 113747200, 227493165, 454985872, 909968764, 1819934952, 3639866058, 7279725522, 14559441844

OFFSET

0,4

LINKS

N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/OR.html">OR</a>

FORMULA

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

MATHEMATICA

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

CROSSREFS

Cf. A007460.

KEYWORD

allocated

nonn

AUTHOR

Ilya Gutkovskiy, Aug 30 2018

STATUS

approved

editing

#1 by Ilya Gutkovskiy at Thu Aug 30 18:00:13 EDT 2018

NAME

allocated for Ilya Gutkovskiy

KEYWORD

allocated

STATUS

approved