|
|
A303611
|
|
a(n) = (-1 - (-2)^(n-2)) mod 2^n.
|
|
0
|
|
|
2, 1, 11, 7, 47, 31, 191, 127, 767, 511, 3071, 2047, 12287, 8191, 49151, 32767, 196607, 131071, 786431, 524287, 3145727, 2097151, 12582911, 8388607, 50331647, 33554431, 201326591, 134217727, 805306367, 536870911, 3221225471, 2147483647, 12884901887, 8589934591
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2^(n-2) - 1 for odd n, otherwise a(n) = 3*2^(n-2) - 1, with n>1.
O.g.f.: x^2*(2 - x + 2*x^2)/((1 - x)*(1 - 2*x)*(1 + 2*x)).
E.g.f.: (1 + 2*x - 4*exp(x) + exp(-2*x) + 2*exp(2*x))/4.
a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3).
a(n) = (2 + (-1)^n)*2^(n-2) - 1. (End)
|
|
MATHEMATICA
|
Table[If[OddQ[n], 2^(n - 2) - 1, 3 2^(n - 2) - 1], {n, 2, 80}]
LinearRecurrence[{1, 4, -4}, {2, 1, 11}, 30]
|
|
PROG
|
(Magma) [IsOdd(n) select 2^(n-2)-1 else 3*2^(n-2)-1: n in [2..40]];
(Magma) I:=[2, 1, 11]; [n le 3 select I[n] else Self(n-1)+4*Self(n-2)-4*Self(n-3): n in [1..35]];
(PARI) a(n) = a(n) = if (n%2, 2^(n-2) - 1, 3*2^(n-2) - 1); \\ Michel Marcus, May 30 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|