login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081322 F(P(n)), where F(n) = Fibonacci numbers A000045, P(n) = Pell numbers A000129. 1
0, 1, 1, 5, 144, 514229, 190392490709135, 93202207781383214849429075266681969, 8269366108663463411004717981412027167937978847386801205243459016220834185059487057696 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

MATHEMATICA

f[n_] := f[n] = f[n - 1] + f[n - 2]; f[0] = 0; f[1] = 1; p[n_] := p[n] = 2p[n - 1] + p[n - 2]; p[0] = 0; p[1] = 1; Table[f[p[n]], {n, 0, 8}]

CROSSREFS

Cf. A081323.

Sequence in context: A037049 A134503 A168041 * A076218 A075186 A113560

Adjacent sequences:  A081319 A081320 A081321 * A081323 A081324 A081325

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Mar 18 2003

EXTENSIONS

Corrected by Don Reble (djr(AT)nk.ca), Nov 20 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.