|
|
A135440
|
|
a(n) = a(n-1) + 2a(n-2).
|
|
6
|
|
|
-1, 4, 2, 10, 14, 34, 62, 130, 254, 514, 1022, 2050, 4094, 8194, 16382, 32770, 65534, 131074, 262142, 524290, 1048574, 2097154, 4194302, 8388610, 16777214, 33554434, 67108862, 134217730, 268435454, 536870914, 1073741822, 2147483650, 4294967294, 8589934594, 17179869182, 34359738370
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
It can be noticed that, once deprived of its first term, this is an "autosequence" of the second kind, whose companion of the first kind is A014113. - Jean-François Alcover, Aug 19 2022
|
|
LINKS
|
|
|
FORMULA
|
O.g.f.: -1/(2*x-1) - 2/(1+x).
a(n) = 2^n - 2*(-1)^n. (End)
|
|
MATHEMATICA
|
LinearRecurrence[{1, 2}, {-1, 4}, 25] (* or *) Table[2^n - 2*(-1)^n, {n, 0, 25}] (* G. C. Greubel, Oct 14 2016 *)
|
|
PROG
|
(Haskell)
a135440 n = a135440_list !! n
a135440_list = zipWith (-) (tail a014551_list) a014551_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|