The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175026 Fibonacci entry points: a(n) = smallest m such that prime(A075702(n)) divides Fibonacci(m). 1
 432, 127, 1426, 10488, 63221, 1328, 11136, 1291186 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS In all cases, a(n) is one of divisors of (A075702(n)): {2160,3048,27094,251712,505768,936240,2182656,2582372}/ {432,127,1426,10488,63221,1328,11136,1291186} = {5,24,19,24,8,705,196,2}. This is used in Mathematica code for faster search. LINKS FORMULA a(n)=A001602(A075702(n)). EXAMPLE a(1)=432 because A075702(1)=2160=5*432, prime(2160)=19009, and F(432)/19009= 45104130506533126693784341438185160821786395872599778181861900641867287643757057395776. MATHEMATICA s={2160, 3048, 27094, 251712, 505768, 936240, 2182656, 2582372}; Do[sk=s[[k]]; dv=Divisors[sk]; i=2; While[Mod[Fibonacci[dvi=dv[[i]]], Prime[sk]]>0, i++ ]; Print[dvi], {k, 8}] CROSSREFS Cf. A001177, A001602, A075702. Sequence in context: A048961 A301645 A063463 * A205192 A066419 A245469 Adjacent sequences: A175023 A175024 A175025 * A175027 A175028 A175029 KEYWORD nonn AUTHOR Zak Seidov, Nov 03 2009 STATUS approved

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.

Last modified December 2 20:59 EST 2022. Contains 358510 sequences. (Running on oeis4.)