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!)
A215158 Primes p such that (2*p - 1)*(4*p + 1)*(14*p - 1) divides Fibonacci(p). 1

%I #13 Apr 03 2023 10:36:13

%S 727,7507,58417,164767,192697,260317,362977,624847,800557,838837,

%T 946417,2107447,2334187,2382607,2461717,2495947,2523517,2566027,

%U 2923747,3169237,3373177,3373687,3763717,3771907,3838897,4143637,4635277,4741837,4979047,5097247

%N Primes p such that (2*p - 1)*(4*p + 1)*(14*p - 1) divides Fibonacci(p).

%H Chris Caldwell, The Prime Glossary, <a href="https://t5k.org/glossary/xpage/FibonacciNumber.html">Fibonacci number</a>

%H C. K. Caldwell, "Top Twenty" page, <a href="https://t5k.org/top20/page.php?id=64">Fibonacci cofactor</a>

%t Select[Prime@Range[10^3], Mod[Fibonacci[#], 112*#^3 - 36*#^2 - 12*# + 1] == 0 &]

%o (PARI) a=-1; b=1; for(n=0, 2548623, a=a+b; b=b+a; p=2*n+1; if(isprime(p)&&Mod(b, 112*p^3-36*p^2-12*p+1)==0, print1(p, ", "))); \\ _Arkadiusz Wesolowski_, Nov 16 2013

%Y Subsequence of A159231.

%Y Cf. A000045, A159259.

%K less,nonn

%O 1,1

%A _Arkadiusz Wesolowski_, Aug 04 2012

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 April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)