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 A176761 #4 Jul 04 2017 12:34:43 %S A176761 1,3,35,39,295,311,33079,33087,37183,38207,1099511665983, %T A176761 1099511666111,1099511797183,1099512059327,1099514156479, %U A176761 1099514156495,1099648374223,1100722116047,1100722124239,1100722126287,1100722388431,9896815410639 %N A176761 Partial sums of A030001, starting at n=1. %C A176761 Partial sums of smallest power of 2 whose decimal expansion contains n. One may see this sequence expressed in binary, rather than decimal, for clarity, though "carries" obscure the characteristic function aspects of structure. The subsequence of primes in this partial sum begins: 3, 311, 1100722116047, 1100722388431. %F A176761 a(n) = SUM[i=1..n] A030001(i). %e A176761 a(6) = 1 + 2 + 32 + 4 + 256 + 16 = 311 is prime. %Y A176761 Cf. A030000, A030001. %K A176761 base,easy,nonn %O A176761 1,2 %A A176761 _Jonathan Vos Post_, Apr 25 2010