OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
EXAMPLE
30 + prime(30) = 30 + 113 = 143 = 13*11.
MATHEMATICA
A108559=Select[Range[800], Mod[Prime[ # ]+#, 11]==0&]
PROG
(Python)
from sympy import prime
def ok(n): return (n + prime(n))%11 == 0
print(list(filter(ok, range(1, 706)))) # Michael S. Branicky, Apr 30 2021
(Python) # much faster version
from sympy import nextprime
def aupton(terms):
p, p_idx, alst = 1, 0, []
while len(alst) < terms:
p, p_idx = nextprime(p), p_idx+1
if (p_idx + p)%11 == 0: alst.append(p_idx)
return alst
print(aupton(54)) # Michael S. Branicky, Apr 30 2021
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Zak Seidov, Jun 10 2005
STATUS
approved