|
Search: id:A060383
|
|
|
| A060383 |
|
a(1) = a(2) = 1; for n >2, a(n) = smallest prime factor of n-th Fibonacci number. |
|
+0
2
|
|
| 1, 1, 2, 3, 5, 2, 13, 3, 2, 5, 89, 2, 233, 13, 2, 3, 1597, 2, 37, 3, 2, 89, 28657, 2, 5, 233, 2, 3, 514229, 2, 557, 3, 2, 1597, 5, 2, 73, 37, 2, 3, 2789, 2, 433494437, 3, 2, 139, 2971215073, 2, 13, 5, 2, 3, 953, 2, 5, 3, 2, 59, 353, 2, 4513, 557, 2, 3, 5, 2, 269, 3, 2, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
n=82: F(82) = 2789*59369*370248451, so a(82)=2789
|
|
MATHEMATICA
|
f[n_] := (FactorInteger@ Fibonacci@ n)[[1, 1]]; Array[f, 70] (* Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 07 2007 *)
|
|
CROSSREFS
|
Cf. A000045, A022307, A001605, A060319, A060320, A051694.
Sequence in context: A079369 A102867 A139044 this_sequence A060442 A060385 A080648
Adjacent sequences: A060380 A060381 A060382 this_sequence A060384 A060385 A060386
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 03 2001
|
|
EXTENSIONS
|
Better definition from Omar E. Pol, Apr 25 2008
|
|
|
Search completed in 0.002 seconds
|
