login
A197117
Number of k such that (2^k-1)*2^n+1 is prime with 0 < k < n+1.
4
1, 2, 0, 3, 1, 2, 0, 3, 2, 2, 0, 3, 1, 4, 0, 3, 2, 5, 2, 4, 2, 1, 1, 2, 3, 2, 1, 2, 2, 3, 0, 4, 2, 4, 1, 2, 4, 7, 0, 4, 3, 3, 0, 4, 5, 1, 0, 3, 2, 2, 1, 1, 2, 2, 0, 2, 3, 2, 1, 4, 0, 5, 0, 2, 5, 4, 0, 7, 4, 2, 2, 7, 0, 3, 1, 2, 0, 5, 0, 2, 3, 1, 0, 4, 4, 0, 0, 1, 0, 8
OFFSET
1,2
COMMENTS
As n increases sum a(n) from n=1 to n / n tends to 2.66.
PROG
(PARI) a(n) = sum(k=1, n, isprime((2^k-1)*2^n+1)); \\ Michel Marcus, Sep 21 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Pierre CAMI, Oct 11 2011
STATUS
approved