|
|
A108559
|
|
Numbers k such that k + prime(k) is divisible by 11.
|
|
2
|
|
|
4, 30, 36, 41, 45, 56, 60, 73, 84, 89, 95, 127, 128, 134, 156, 183, 193, 194, 201, 239, 244, 251, 284, 302, 323, 331, 348, 360, 368, 372, 387, 391, 409, 413, 431, 432, 442, 454, 463, 496, 514, 516, 546, 565, 568, 620, 629, 636, 646, 667, 684, 696, 703, 705
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
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
(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
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|