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 A086059 #7 Oct 18 2018 22:44:47 %S A086059 128,320,608,928,1360,1808,2288,2936,3608,4312,5032,5832,6664,7636, %T A086059 8644,9700,10780,11868,12988,14188,15404,16652,18110,19582,21094, %U A086059 22662,24246,25866,27498,29178,30938,32738,34562,36418,38290,40274,42274,44354 %N A086059 Sum of first n 7-almost primes. %C A086059 Elements in this sequence can themselves be 7-almost primes. a(1) = 128 = 2^7. Also a 7-Brilliant number. a(2) = 320 = 2^6 * 5. Also a 7-Brilliant number. Does this happen infinitely often? - _Jonathan Vos Post_, Dec 11 2004 %e A086059 a(2)=320 because sum of first two 7-almost primes i.e. 128+192 is 320. %t A086059 Accumulate[Select[Range[2500],PrimeOmega[#]==7&]] (* _Harvey P. Dale_, Oct 18 2018 *) %K A086059 easy,nonn %O A086059 1,1 %A A086059 _Shyam Sunder Gupta_, Aug 24 2003