cp's OEIS Frontend

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.

A048260 The sum of 2 (not necessarily distinct) abundant numbers.

This page as a plain text file.
%I A048260 #19 Apr 29 2022 03:48:30
%S A048260 24,30,32,36,38,40,42,44,48,50,52,54,56,58,60,62,64,66,68,70,72,74,76,
%T A048260 78,80,82,84,86,88,90,92,94,96,98,100,102,104,106,108,110,112,114,116,
%U A048260 118,120,122,124,126,128,130,132,134,136,138,140,142,144,146,148,150
%N A048260 The sum of 2 (not necessarily distinct) abundant numbers.
%C A048260 20161 is the largest number not in this sequence.
%D A048260 The Penguin Dictionary of Curious and Interesting Numbers, David Wells, entry 20161.
%F A048260 a(n) = n + 1456 if n > 18705. - _Charles R Greathouse IV_, Feb 21 2017
%e A048260 12 is abundant, so 12+12=24 is in the sequence.
%e A048260 957 = 12 + 945 is in the sequence because 12 and 945 are abundant.
%Y A048260 Cf. A005101. Complement of A048242.
%K A048260 nonn,easy
%O A048260 1,1
%A A048260 _Jud McCranie_