|
Search: id:A068098
|
|
|
| A068098 |
|
a(n) = L(F(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number. |
|
+0
3
|
|
| 2, 1, 1, 3, 4, 11, 47, 521, 24476, 12752043, 312119004989, 3980154972736918051, 1242282009792667284144565908482
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
FORMULA
|
For n>2, a(n) = round{Phi^F(n-1)}. - Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Sep 19 2004
|
|
CROSSREFS
|
Sequence in context: A124424 A057044 A153899 this_sequence A135722 A049513 A121207
Adjacent sequences: A068095 A068096 A068097 this_sequence A068099 A068100 A068101
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet, Mar 22 2002
|
|
EXTENSIONS
|
More terms from Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Sep 19 2004
|
|
|
Search completed in 0.002 seconds
|
