|
| |
|
|
A138184
|
|
Largest prime not exceeding Fibonacci(n) = A000045(n).
|
|
3
|
|
|
|
2, 3, 5, 7, 13, 19, 31, 53, 89, 139, 233, 373, 607, 983, 1597, 2579, 4177, 6763, 10939, 17707, 28657, 46351, 75017, 121379, 196387, 317797, 514229, 832003, 1346249, 2178283, 3524569, 5702867, 9227443, 14930341, 24157811, 39088157, 63245971
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
3,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=3,...,657
|
|
|
FORMULA
|
a(n)=A000040(A054782(n)). - R. J. Mathar, Apr 22 2008
|
|
|
EXAMPLE
|
a(8)=19 because 19 is the largest prime not exceeding 21 = A000045(8).
|
|
|
MAPLE
|
A138184 := proc(n) prevprime(combinat[fibonacci](n)+1) ; end: seq(A138184(n), n=3..45) ; - R. J. Mathar, Apr 22 2008
|
|
|
MATHEMATICA
|
PrimePrev[n_]:=Module[{k=n}, While[ !PrimeQ[k], k-- ]; k]; f[n_]:=Fibonacci[n]; lst={}; Do[AppendTo[lst, PrimePrev[f[n]]], {n, 5!}]; lst [From Vladimir Joseph Stephan Orlovsky, Feb 26 2010]
|
|
|
CROSSREFS
|
Cf. A138181, A138182, A138183, A138185.
Sequence in context: A171969 A075580 A077132 * A008965 A113864 A188754
Adjacent sequences: A138181 A138182 A138183 * A138185 A138186 A138187
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
Colm Mulcahy, Mar 04 2008
|
|
|
EXTENSIONS
|
Edited and extended by R. J. Mathar, Apr 22 2008
Changed the first offset from 4 to 3 Harry J. Smith, Jan 02 2009
|
|
|
STATUS
|
approved
|
| |
|
|
