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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078735 a(0) = 0, a(1) = 3; a(n+1) = the smallest x such that Fibonacci(x)-Fibonacci(a(n)) is both prime and greater than Fibonacci(a(n))-Fibonacci(a(n-1)). 1
0, 3, 5, 9, 13, 18, 37, 384, 569, 2760, 3293 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Some of the larger entries may only correspond to probable primes.

FORMULA

A078727(n) = Fibonacci(a(n))-Fibonacci(a(n-1))

MATHEMATICA

a[0] = 0; a[1] = 3; a[n_] := a[n] = Block[{d = Fibonacci[a[n - 1]] - Fibonacci[a[n - 2]], f = Fibonacci[a[n - 1]], k = a[n - 1] + 1}, While[Fibonacci[k] - f <= d || !PrimeQ[Fibonacci[k] - f], k++ ]; k]; Do[ Print[ a[n]], {n, 0, 10}] (* Robert G. Wilson v *)

CROSSREFS

A more compact version of A078727.

Cf. A000045.

Sequence in context: A203567 A071404 A074133 * A004132 A065802 A118028

Adjacent sequences:  A078732 A078733 A078734 * A078736 A078737 A078738

KEYWORD

nonn

AUTHOR

Jack Brennen (jb(AT)brennen.net), Dec 20 2002

EXTENSIONS

a(10) from Robert G. Wilson v (rgwv(at)rgwv.com), Nov 30 2005

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 16:51 EST 2012. Contains 205938 sequences.