OFFSET
1,2
COMMENTS
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000 (terms 1..192 from Antti Karttunen)
PROG
(PARI) lista(nn) = {r = 0; for (n=1, nn, nr = gcd(vector(n-1, k, binomial(2*n, 2*k))); if (nr > r, print1(nr, ", "); r = nr); ); } \\ Michel Marcus, Dec 08 2015. Note: this gives correct value for a(1) only from PARI version 2.8 onward, see A265388 for why. - Antti Karttunen, Dec 11 2015
(Python)
from math import prod
from itertools import count, islice
from sympy.ntheory.factor_ import digits
from sympy import primefactors
def A265395_gen(): # generator of terms
c = -1
for n in count(1):
m = prod((p if sum(digits(n<<1, p)[1:])==2 else 1) for p in primefactors(n*((n<<1)-1)) if p>2)<<(not(n&-n)^n) if n>1 else 0
if m>c:
yield m
c = m
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 08 2015
STATUS
approved
