login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096424 a(1)=a(2)=1, a(n) = (a(n-2)+F(n-2)) * (a(n-1)+F(n-1)) for n > 2 where F(i) is the i-th Fibonacci no. 0
1, 1, 4, 12, 90, 1425, 136135, 195100084, 26562489095540, 5182344411607842435270, 137655966922842171797061456838751550, 713380630907065135419001299147560152192298801082595247675 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
The terms have an interesting factorization pattern, often sharing factors.
LINKS
MATHEMATICA
nxt[{n_, a_, b_}]:={n+1, b, (a+Fibonacci[n-1])(b+Fibonacci[n])}; Join[{1}, Transpose[ NestList[nxt, {2, 1, 1}, 10]][[3]]] (* Harvey P. Dale, Jun 16 2016 *)
CROSSREFS
Sequence in context: A064280 A203379 A209031 * A009629 A203110 A197919
KEYWORD
nonn
AUTHOR
Gerald McGarvey, Aug 08 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 15:08 EDT 2024. Contains 372340 sequences. (Running on oeis4.)