OFFSET
1,1
COMMENTS
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..503
M. Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems, sect. 1.3: Binomial coefficients modulo integers, binomod.gp
PROG
(PARI) for(k=2, 999, n=2^k-1; binodiv(2*n-2, n-1, n^2-n) && !binodiv(2*n, n, n^2-1) && print1(k", ")); \\ updated by Max Alekseyev, Jan 22 2026
(Python)
from itertools import count, islice
from oeis_sequences.OEISsequences import binom_mod
def A260641_gen(startvalue=2): # generator of terms >= startvalue
for k in count(max(startvalue, 2)):
m = (1<<k)-1
if not binom_mod(m-1<<1, m-1, m*(m-1)) and binom_mod(m<<1, m, m**2-1):
yield k
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Nov 11 2015
EXTENSIONS
Terms a(26) onward from Max Alekseyev, Jan 22 2026
STATUS
approved
