|
| |
|
|
A068098
|
|
a(n) = L(F(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number.
|
|
3
| |
|
|
2, 1, 1, 3, 4, 11, 47, 521, 24476, 12752043, 312119004989, 3980154972736918051, 1242282009792667284144565908482, 4944474918817897417578506056549605984335718813571
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..22
|
|
|
FORMULA
| For n>2, a(n) = round{Phi^F(n-1)}. - Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Sep 19 2004
|
|
|
MATHEMATICA
| LucasL[Fibonacci[Range[0, 15]]] (* From Harvey P. Dale, Sep 29 2011 *)
|
|
|
PROG
| (MAGMA) [Lucas(Fibonacci(n)) : n in [0..13]]; /7 Vincenzo Librandi, Sep 30 2011
|
|
|
CROSSREFS
| Sequence in context: A124424 A057044 A153899 * A135722 A049513 A121207
Adjacent sequences: A068095 A068096 A068097 * 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
a(13) from Vincenzo Librandi, Sep 30 2011
|
| |
|
|
