Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Oct 30 2018 10:31:02
%S 5,5,29,29,29,41,41,41,41,41,41,341,341,341,341,341,341,479,479,479,
%T 749,749,749,749,749,749,749,749,749,3461,3461,3461,3561,3561,3701,
%U 3701,3701,3701,3701,3701,3701,3701,3701,3701,6041,6041,6041,6041,6041,6041
%N Smallest integer m such that each sum of m plus the square of an even number up to 2n is an odd composite numbers.
%e a(1)=5 because 2^2+{1,3} are prime and 2^2+5 is composite;
%e a(2)=5 because the least m such that all {2^2,4^2}+m are all odd composite is 5;
%e a(3)=29 because the least m such that all {2^2,4^2,6^2}+m are all odd composite is 29.
%K nonn
%O 1,1
%A _Zak Seidov_, Dec 29 2011