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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086382 k divides F(k*n^2+1)-F(k+1) for 1<=k<=a(n) where F(k) is the k-th Fibonacci number. 0
2, 1, 2, 10, 1, 10, 2, 1, 2, 12, 1, 10, 2, 1, 2, 10, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 16, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 16, 1, 10, 2, 1, 2, 10, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 12, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 36, 1, 10, 2, 1, 2, 10, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 12, 1, 12 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

FORMULA

a(3n)=1; a( A047235(n))=2

PROG

(PARI) a(n)=if(n<0, 0, m=1; while((fibonacci(m*n^2+1)-fibonacci(m+1))%m==0, m++); m-1)

CROSSREFS

Sequence in context: A173159 A002079 A078357 * A062345 A077098 A069238

Adjacent sequences:  A086379 A086380 A086381 * A086383 A086384 A086385

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 06 2003

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 16 19:05 EST 2012. Contains 205943 sequences.