OFFSET
1,1
COMMENTS
LINKS
R. J. Mathar, Table of n, a(n) for n = 1..57
MAPLE
A167859 := proc(n)
option remember;
if n <= 1 then
add( (binomial(2*k, k)/2^k)^2, k=0..n) ;
4^n*% ;
else
4*(5*n^2 - 4*n + 1)*procname(n-1) - 16*(2*n - 1)^2*procname(n-2) ;
%/n^2 ;
end if;
end proc:
isA167860 := proc(p)
local m ;
for m from (p-1)/2 to p-1 do
if modp(A167859(m), p) > 0 then
return false;
end if;
end do:
true ;
end proc:
A167860 := proc(n)
option remember ;
if n = 0 then
2;
else
p := nextprime(procname(n-1)) ;
while not isA167860(p) do
p := nextprime(p) ;
end do ;
return p;
end if;
end proc:
seq(A167860(n), n=1..10) ; # R. J. Mathar, Jan 22 2025
PROG
(PARI) is(p) = if(isprime(p)&&p%2, my(m=Mod(1, p), s=m); for(k=1, p\2, s+=(m*=(2*k-1)/k)^2); !s, 0); \\ Jinyuan Wang, Jul 24 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Alexander Adamchuk, Nov 13 2009
EXTENSIONS
More terms from Jinyuan Wang, Jul 24 2022
STATUS
approved