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 A046669 #32 Jan 05 2024 07:25:10 %S A046669 1,3,6,8,13,15,22,24,27,29,40,42,55,57,60,62,79,81,100,102,105,107, %T A046669 130,132,137,139,142,144,173,175,206,208,211,213,218,220,257,259,262, %U A046669 264,305,307,350,352,355,357,404,406,413,415,418,420,473 %N A046669 Partial sums of A020639. %D A046669 M. Kalecki, On certain sums extended over primes or prime factors (in Polish), Prace Mat., Vol. 8 (1963/64), pp. 121-129. %D A046669 József Sándor, Dragoslav S. Mitrinovic and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, Section IV.1, p. 121. %H A046669 T. D. Noe, <a href="/A046669/b046669.txt">Table of n, a(n) for n = 1..1000</a> %H A046669 A. E. Brouwer, <a href="/A046670/a046670.pdf">Two number theoretic sums</a>, Stichting Mathematisch Centrum. Zuivere Wiskunde, Report ZW 19/74 (1974): 3 pages. [Cached copy, included with the permission of the author] %F A046669 a(n) = A088821(n) + 1. %F A046669 From _Amiram Eldar_, Mar 04 2021: (Start) %F A046669 a(n) ~ ((1 + o(1))/2)* n^2/log(n) (Kalecki, 1963/64). %F A046669 a(n) = (1/2) * n^2/log(n) + O(n^2/log(n)^2) (Brouwer, 1974). (End) %t A046669 Accumulate[Array[FactorInteger[#][[1,1]]&,60]] (* _Harvey P. Dale_, Apr 20 2011 *) %o A046669 (Haskell) %o A046669 a046669 n = a046669_list !! (n-1) %o A046669 A046669_list = scanl1 (+) a020639_list -- _Reinhard Zumkeller_, Jun 15 2013 %Y A046669 Cf. A020639, A046670, A072486, A088821. %K A046669 nonn,nice,easy %O A046669 1,2 %A A046669 _N. J. A. Sloane_