|
| |
|
|
A049686
|
|
a(n)=F(8n)/3, where F=A000045 (the Fibonacci sequence).
|
|
1
| |
|
|
0, 7, 329, 15456, 726103, 34111385, 1602508992, 75283811239, 3536736619241, 166151337293088, 7805576116155895, 366695926122033977, 17226902951619441024, 809297742799991694151, 38019767008647990184073
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n) = 47*a(n-1) - a(n-2), n>1. a(0)=0, a(1)=7. G.f.: 7*x/(1-47*x+x^2).
a(n)=-(1/15)*sqrt(5)*[47/2-(21/2)*sqrt(5)]^n+(1/15)*[47/2+(21/2)*sqrt(5)]^n*sqrt(5), with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Oct 07 2008]
|
|
|
CROSSREFS
| A049686(n) = A004187(2n).
Sequence in context: A109059 A002000 A092588 * A177019 A160432 A009587
Adjacent sequences: A049683 A049684 A049685 * A049687 A049688 A049689
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
EXTENSIONS
| Better description and more terms from Michael Somos
|
| |
|
|
