|
|
A054782
|
|
Number of primes <= the n-th Fibonacci number.
|
|
10
|
|
|
0, 0, 0, 1, 2, 3, 4, 6, 8, 11, 16, 24, 34, 51, 74, 111, 166, 251, 376, 574, 871, 1329, 2033, 3121, 4794, 7396, 11425, 17688, 27426, 42613, 66317, 103298, 161207, 251757, 393790, 616645, 966507, 1516410, 2381429, 3743010, 5888201, 9269519, 14604028
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
with(combinat): with(numtheory): seq(pi(fibonacci(n)), n = 0 .. 42); # Emeric Deutsch, Jun 24 2009
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [prime_pi(fibonacci(n)) for n in range(0, 43)] # Zerinvary Lajos, Jun 06 2009
(Magma) [0] cat [#PrimesUpTo(Fibonacci(n)): n in [1..42]]; // Vincenzo Librandi, Apr 25 2019
(PARI) a(n) = primepi(fibonacci(n)); \\ Michel Marcus, Apr 25 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|