The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com
A090369
Smallest divisor of 2n that is > 2, or 0 if no such divisor exists.
A090369 := proc(n) local lf, i ; lf := numtheory[divisors](2*n) ; for i from 1 to nops(lf) do if op(i, lf) > 2 then RETURN( op(i, lf) ) ; fi ; od ; RETURN(0) ; end : for n from 0 to 100 do printf("%d, ", A090369(n)) ; od ; # R. J. Mathar, Jun 02 2006