A277062 Number of primes <= n-th Lucas number.

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

Author

Vincenzo Librandi, Nov 09 2016

Keywords

• nonn

Links

• Amiram Eldar, Table of n, a(n) for n = 0..101 (calculated using Kim Walisch's primecount)
• Kim Walisch, Fast C++ prime counting function implementation (primecount).

Crossrefs

Cf. A000032, A000720, A001606, A005479, A052012, A054782.

Programs

Magma

[#PrimesUpTo(Lucas(n)): n in [0..41]];

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}]

Formula

a(n) = A000720(A000032(n)). - Michel Marcus, Jun 10 2024