|
Search: id:A062092
|
|
|
| A062092 |
|
a(n)=2*a(n-1)-(-1)^n, a(0)=2. |
|
+0
4
|
|
| 2, 5, 9, 19, 37, 75, 149, 299, 597, 1195, 2389, 4779, 9557, 19115, 38229, 76459, 152917, 305835, 611669, 1223339, 2446677, 4893355, 9786709, 19573419, 39146837, 78293675, 156587349, 313174699, 626349397, 1252698795, 2505397589
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
T. Koshy, Fibonacci and Lucas numbers with applications, Wiley, 2001, p. 98.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,200
|
|
FORMULA
|
a(n)=a(n-1)+2*a(n-2)=(7*2^n-(-1)^n)/3.
G.f.: (2+3*x)/(1-x-2*x^2). E.g.f.: (7*exp(2*x)-exp(-x))/3.
Running sum of 3 consecutive elements of Jacobsthal sequence A001045(n): a(n) = A001045(n) + A001045(n-1) + A001045(n-2). - Alexander Adamchuk (alex(AT)kolmogorov.com), May 16 2006
|
|
EXAMPLE
|
a(4) = 37 hence a(5) = 2*37 + 1=75 and a(6) = 2*75 - 1 = 149.
|
|
PROGRAM
|
(PARI) { for (n=0, 200, write("b062092.txt", n, " ", (7*2^n - (-1)^n)/3) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 01 2009]
|
|
CROSSREFS
|
Cf. A062092(n)=2^(n+1)+A001045(n). A002487(A062092(n))=A000032(n+1).
Cf. A001045.
Sequence in context: A014495 A056326 A122893 this_sequence A079117 A030137 A105309
Adjacent sequences: A062089 A062090 A062091 this_sequence A062093 A062094 A062095
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 16 2001
|
|
EXTENSIONS
|
More terms from Jason Earls (zevi_35711(AT)yahoo.com), Jun 18 2001
Additional comments from Michael Somos, Jun 24 2002
|
|
|
Search completed in 0.002 seconds
|
