|
|
A105286
|
|
Numbers k such that prime(k+1) == 1 (mod k).
|
|
8
|
|
|
1, 2, 3, 10, 24, 25, 66, 168, 182, 186, 187, 188, 438, 6462, 40071, 40084, 40085, 40091, 40108, 40118, 251745, 637224, 637306, 637336, 637338, 10553441, 10553445, 10553452, 10553479, 10553515, 10553550, 10553829, 27067032, 27067054, 27067134, 69709710, 69709713, 179992838, 179993008
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
If k is a term, then prime(k+1)^prime(k+1) is a reverse Meertens number in base prime(k+1)^((prime(k+1)-1)/k). - Chai Wah Wu, Dec 14 2022
|
|
LINKS
|
|
|
MATHEMATICA
|
bb={}; Do[If[1==Mod[Prime[n+1], n], bb=Append[bb, n]], {n, 1, 200000}]; bb
|
|
PROG
|
(Sage)
terms = []
p = 3
for n in range(1, max+1) :
if (p - 1) % n == 0 : terms.append(n)
p = next_prime(p)
return terms
(Python)
from itertools import count, islice
from sympy import prime
def A105286_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda k: not (prime(k+1)-1)%k, count(max(startvalue, 1)))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|