login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A277062
Number of primes <= n-th Lucas number.
5
1, 0, 2, 2, 4, 5, 7, 10, 15, 21, 30, 46, 66, 98, 146, 218, 329, 500, 757, 1158, 1766, 2716, 4164, 6420, 9907, 15320, 23760, 36878, 57356, 89288, 139283, 217506, 340059, 532321, 834147, 1308186, 2053958, 3227229, 5075229, 7987852, 12581575, 19831014
OFFSET
0,3
LINKS
Amiram Eldar, Table of n, a(n) for n = 0..101 (calculated using Kim Walisch's primecount)
FORMULA
a(n) = A000720(A000032(n)). - Michel Marcus, Jun 10 2024
MAPLE
a:= n-> numtheory[pi]((<<0|1>, <1|1>>^n. <<2, 1>>)[1$2]):
seq(a(n), n=0..35); # Alois P. Heinz, Nov 09 2016
MATHEMATICA
Table[PrimePi[LucasL[n]], {n, 0, 50}]
PROG
(Magma) [#PrimesUpTo(Lucas(n)): n in [0..41]];
CROSSREFS
KEYWORD
nonn
AUTHOR
Vincenzo Librandi, Nov 09 2016
STATUS
approved