login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A333503 Differences between consecutive odd abundant numbers. 1
630, 630, 630, 630, 630, 630, 630, 420, 210, 450, 180, 210, 420, 180, 450, 210, 330, 90, 420, 210, 420, 210, 630, 630, 630, 630, 420, 210, 630, 630, 630, 210, 420, 630, 630, 630, 630, 630, 630, 90, 330, 210, 630, 630, 630, 210, 330, 90, 630, 210, 420, 630, 630 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) = A005231(n+1) - A005231(n).
Since 945+1890*k is odd and abundant for all k, 1890 is the maximal term that occurs. The first time it occurs is for a(274)=1890, and the involved odd abundant numbers are 135135 and 137025.
Clearly 2 is the minimal term that can occur. For an example, see comment to A294025.
LINKS
MATHEMATICA
Differences@ Select[Range[947, 3*10^4 + 1, 2], DivisorSigma[1, #] > 2 # &] (* Michael De Vlieger, Mar 25 2020 *)
PROG
(PARI) my(oldn=945); forstep(n=947, 5*10^4, 2, if(sigma(n)>2*n, print1(n-oldn, ", "); oldn=n))
CROSSREFS
Sequence in context: A098261 A256937 A177421 * A173423 A295769 A110904
KEYWORD
nonn
AUTHOR
Jeppe Stig Nielsen, Mar 24 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)