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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072381 Numbers n such that Fibonacci(n) is a semiprime. 6
8, 9, 10, 14, 19, 22, 26, 31, 34, 41, 53, 59, 61, 71, 73, 79, 89, 94, 101, 107, 109, 113, 121, 127, 151, 167, 173, 191, 193, 199, 227, 251, 271, 277, 293, 331, 353, 397, 401, 467, 587, 599, 601, 613, 631, 653, 743, 991 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Note that there are two cases: (1) n is 2p, in which case the semiprime is Fibonacci(p)*Lucas(p) for some prime p, or (2) n is a power of a prime p^k for k>0. In the first case, the primes p are in sequence A080327. In the second case, it appears that k=1 except for n = 8, 9 and 121. - T. D. Noe (noe(AT)sspectra.com), Sep 23 2005

REFERENCES

Y. Bugeaud, F. Luca, M. Mignotte and S. Siksek, On Fibonacci numbers with few prime divisors, Proc. Japan Acad., 81, Ser. A (2005), pp. 17-20.

LINKS

R. Knott, Fibonacci numbers

EXAMPLE

a(4)=14, so 14th Fibonacci number i.e. 377 is a semiprime (377=13*29).

MATHEMATICA

Select[Range[200], Plus@@Last/@FactorInteger[Fibonacci[ # ]] == 2&] (Noe)

CROSSREFS

Cf. A053409.

Cf. A085726 (n such that n-th Lucas number is a semiprime).

Sequence in context: A067683 A164276 A154967 * A046415 A091417 A069237

Adjacent sequences:  A072378 A072379 A072380 * A072382 A072383 A072384

KEYWORD

nonn

AUTHOR

Shyam Sunder Gupta (guptass(AT)rediffmail.com), Jul 20 2002

EXTENSIONS

More terms from Don Reble (djr(AT)nk.ca), Jul 31 2002

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 14 22:45 EST 2012. Contains 205680 sequences.