|
|
A352186
|
|
The numbers k arising in A352185.
|
|
3
|
|
|
1, 4, 1, 5, 5, 12, 1, 1, 1, 19, 19, 19, 19, 19, 19, 19, 19, 27, 27, 47, 47, 47, 47, 14, 14, 14, 14, 14, 67, 67, 67, 67, 67, 173, 173, 211, 211, 211, 211, 15, 15, 15, 15, 15, 15, 214, 214, 214, 214, 214, 385, 385, 385, 385, 385, 385, 385, 22, 22, 22, 22, 22, 22, 22
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
PROG
|
(Python)
from math import gcd
from sympy import isprime
from itertools import count, islice, takewhile
def comp(n): return not isprime(n)
def agen(): # generator of terms
n = 1
for m in count(2):
for k in range(1, m):
if gcd(k, m) != 1:
continue
ap = len(list(takewhile(comp, (i*m+k for i in count(1)))))
if ap >= n:
for i in range(n, ap+1):
yield k
n = ap + 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|