This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A112974 #7 Mar 30 2012 17:22:41 %S A112974 1,0,3,0,2,4,0,4,6,0,2,3,6,8,6,0,10,10,5,2,11,9,10,0,9,10,12,4,13,14, %T A112974 15,11,6,14,0,12,2,12,11,5,10,11,12,12,12,11,11,13,13,0,15,14,3,14,16, %U A112974 16,8,16,17,17,19,20,16,14,7,16,2,16,14,15,3,15,15,14,18,0,16,16,16,16,16,14 %N A112974 Number of superabundant numbers between two consecutive colossally abundant numbers. %C A112974 The colossally abundant numbers are a subset of the superabundant abundant numbers. Is there a formula for a(n) that depends on the two consecutive colossally abundant numbers A004490(n) and A004490(n+1)? %H A112974 T. D. Noe, <a href="/A112974/b112974.txt">Table of n, a(n) for n=1..10000</a> %e A112974 a(3)=3 because between colossally abundant numbers 12 and 60 there are three superabundant numbers: 24, 36 and 48. %Y A112974 Cf. A004490 (colossally abundant numbers), A004394 (superabundant numbers), A189228 (superabundant numbers that are not colossally abundant). %K A112974 nonn %O A112974 1,3 %A A112974 _T. D. Noe_, Oct 07 2005