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!)
A087580 Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1). 0

%I #4 Dec 05 2013 19:56:31

%S 2,3,5,11,31,47,73,157,191,521,877,1021,1487,6011,7841,11789,14983,

%T 33071,83243,123833,156671,262937,778763,825131,975181,5102543,

%U 7066723,12787321,13815779,21304139,72462361,76818979,87392713,110204261

%N Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1).

%K nonn

%O 0,1

%A _Amarnath Murthy_, Sep 17 2003

%E More terms from _David Wasserman_, Jun 13 2005

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 July 24 21:09 EDT 2024. Contains 374585 sequences. (Running on oeis4.)