OFFSET
1,1
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..94
MAPLE
A073078 := proc(n)
local bink, k ;
bink := 1 ;
for k from 1 do
bink := 2*bink*(2-1/k) ;
if modp(bink, n) = 0 then
return k;
end if;
end do:
end proc:
A079290 := proc(n)
option remember;
local a;
if n = 1 then
9;
else
for a from procname(n-1)+1 do
if not isprime(a) and 2*A073078(a) = a+1 then
return a;
end if;
end do:
end if;
end proc: # R. J. Mathar, Aug 20 2014
MATHEMATICA
b[n_] := For[k=1, True, k++, If[Divisible[Binomial[2k, k], n], Return[k]]];
Select[Select[Range[12000], CompositeQ], b[#] == (# + 1)/2&] (* Jean-François Alcover, Oct 31 2019 *)
PROG
(PARI) p=5; forprime(q=7, 1e4, forstep(n=p+2, q-2, 2, for(s=2, n\2, if(binomial(2*s, s)%n==0, next(2))); print1(n", ")); p=q) \\ Charles R Greathouse IV, May 24 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 09 2003
EXTENSIONS
a(21)-a(43) from Charles R Greathouse IV, May 24 2013
STATUS
approved