# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a306497
Showing 1-1 of 1

%I A306497 #36 Apr 11 2021 16:14:28
%S A306497 5391411025,26957055120,28816162375,33426748350,34393484125,
%T A306497 37739877175,40342627320,48150877770,50866790970,53356378075,
%U A306497 59305521270,60711976320,61164628525,63395557225,64899009175,67275433225,70088343325,74922022170,75665665075,76781129425
%N A306497 Abundant numbers that differ from the next abundant number by 5.
%C A306497 Since all multiples of 6 are abundant, numbers in this sequence have to be abundant numbers of the form 6n or 6n + 1.  Most common difference between abundant numbers is 6, followed by 2, 4, 3, 1. 5 is the least common.
%H A306497 David A. Corneth, <a href="/A306497/b306497.txt">Table of n, a(n) for n = 1..10000</a>
%F A306497 Either a(n) or a(n)+5 are in A115414. - _Amiram Eldar_, Jul 16 2019
%e A306497 a(1) = 5391411025 is in the sequence since it is abundant and the next abundant number is 5391411030 which is a(1)+5 and all the numbers in between are deficient.
%o A306497 (PARI) isok(n) = for(k=1, 4, if(sigma(n+k) > 2*(n+k), return(0))); (sigma(n) > 2*n) && (sigma(n+5) > 2*(n+5)); \\ _Daniel Suteu_, Jul 24 2019
%Y A306497 Cf. A005101, A096399, A231086, A228382, A316098, A316099, A115414, A125115.
%K A306497 nonn
%O A306497 1,1
%A A306497 _Sergio Pimentel_, Feb 19 2019
%E A306497 More terms from _Amiram Eldar_, Jul 16 2019

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE