OFFSET
1,1
COMMENTS
Every even number >= 3706141025766237065507279802221127212928 is the sum of two odd abundant numbers. The largest even number which does not appear in this sequence is unknown.
LINKS
Donovan Johnson, Table of n, a(n) for n = 1..1000
EXAMPLE
945 is the smallest odd abundant number, so 945 + 945 = 1890 is the first term in the sequence.
PROG
(PARI) mx=66240; x=vector(mx); k=144; v=vector(k); c=0; forstep(i=945, mx-1, 2, if(sigma(i)-2*i>0, c++; v[c]=i)); for(i=1, k, for(j=i, k, s=v[i]+v[j]; if(s<=mx, x[s]=1, next(2)))); c=0; forstep(n=1890, mx, 2, if(x[n]==1, c++; write("b168226.txt", c " " n))) /* Donovan Johnson, Jan 03 2013 */
CROSSREFS
KEYWORD
nonn
AUTHOR
William Rex Marshall, Nov 20 2009
STATUS
approved