OFFSET
0,6
LINKS
Tom Müller, On the Exponents of Non-Trivial Divisors of Odd Numbers and a Generalization of Proth's Primality Theorem, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.7.
EXAMPLE
We always have 2^k + 1 < h2^s + 1 if k < s. Thus a(1)=0.
MAPLE
a:= proc(n)
H:=2*n+1:
smax:=floor(evalf(log[2](H))):
R:=0:
for r from 1 to smax-1 do;
for s from r+1 to smax do;
kmax:=floor(evalf(H/2^s)):
for k from 1 to kmax by 2 do;
h:=(H-2^(s-r)*k)/(2^s*k+1):
if h<1 then break fi;
if type(h, integer) and R<r then R:=r fi;
od;
od;
od;
R;
end:
seq(a(n), n=0..100);
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Tom Mueller, May 09 2016
STATUS
approved