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 A086061 #10 Nov 02 2024 13:27:38 %S A086061 256,640,1216,1856,2720,3616,4576,5872,7216,8624,10064,11664,13328, %T A086061 15272,17288,19400,21560,23736,25976,28376,30808,33304,36220,39164, %U A086061 42188,45324,48492,51732,54996,58356,61876,65476,69124,72836,76580 %N A086061 Sum of first n 8-almost primes. %C A086061 Elements in this sequence can themselves be 8-almost primes, as happens often for 5-almost primes. a(1) = 256 = 2^8. Also an 8-Brilliant number. a(2) = 640 = 2^7 * 5. Also an 8-Brilliant number. Does this happen infinitely often? - _Jonathan Vos Post_, Dec 11 2004 %H A086061 Harvey P. Dale, <a href="/A086061/b086061.txt">Table of n, a(n) for n = 1..1000</a> %e A086061 a(2)=640 because sum of first two 8-almost primes i.e. 256+384 is 640. %t A086061 Accumulate[Select[Range[10000],Total[FactorInteger[#][[;;,2]]]==8&]] (* _Harvey P. Dale_, Nov 02 2024 *) %K A086061 easy,nonn %O A086061 1,1 %A A086061 _Shyam Sunder Gupta_, Aug 24 2003