Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096424
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 4, 12, 90, 1425, 136135, 195100084, 26562489095540, 5182344411607842435270, 137655966922842171797061456838751550, 713380630907065135419001299147560152192298801082595247675 (list; graph; listen)
OFFSET

1,3

COMMENT

The terms have an interesting factorization pattern, often sharing factors.

CROSSREFS

Sequence in context: A010370 A081214 A064280 this_sequence A009629 A009651 A074930

Adjacent sequences: A096421 A096422 A096423 this_sequence A096425 A096426 A096427

KEYWORD

nonn

AUTHOR

Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Aug 08 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research