This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A177086 Semiprimes n such that n divides Fibonacci number F(n-1). 1
 1891, 4181, 8149, 13201, 15251, 17711, 40501, 51841, 64079, 64681, 67861, 68251, 78409, 88601, 88831, 90061, 96049, 97921, 115231, 118441, 145351, 146611, 153781, 191351, 197209, 218791, 219781, 254321, 272611, 302101, 303101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is the semiprime (A001358) analog of A045468. Now A045468 has a very simple characterization - it consists of the primes ending in 1 or 9. Can one say anything about the present sequence? LINKS FORMULA {n: n is in A001358 and n|A000045(n-1)} = A069106 INTERSECTION A001358. EXAMPLE 46368/23 = 2016 = 2^5 * 3^2 * 7 so (24-1) | F(24) but 24 is not semiprime, so is not in the sequence. a(1) = 1891 = 31 * 61 is not in the sequence because 1891 divides F(1891-1) = F(1890). a(21) = 146611 = 271 * 541 because 146611 | F(146610). MATHEMATICA Select[Range[310000], PrimeOmega[#]==2 && Divisible[Fibonacci[#-1], #]&] (* Harvey P. Dale, May 02 2016 *) CROSSREFS Cf. A000040, A000045, A001358, A069106, A045468, A003631, A064739, A081264 (Fibonacci pseudoprimes). Cf. A177745 (semiprimes n such that n divides Fibonacci number F(n+1)) Sequence in context: A251821 A151773 A020321 * A254285 A035869 A045198 Adjacent sequences:  A177083 A177084 A177085 * A177087 A177088 A177089 KEYWORD nonn,easy AUTHOR Jonathan Vos Post, Dec 09 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.