Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Dec 24 2014 10:53:03
%S 1,2,3,4,5,7,8,9,10,12,13,15,16,18,20,21,22,24,25,27,29,31,32,34,35,
%T 37,38,40,41,44,45,46,48,50,52,54,55,57,59,61,62,65,66,68,70,72,73,75,
%U 76,78,80,82,83,85,87,89,91,93,94,97,98,100,102,103,105,108,109,111,113
%N 1 + sum of first n terms of A001221.
%H Michael De Vlieger, <a href="/A082186/b082186.txt">Table of n, a(n) for n = 1..2000</a>
%p with(numtheory): s := 1: for n from 1 to 150 do it := nops(ifactors(n)[2]): s := s+it: printf(`%d,`,s): od: # _James A. Sellers_, May 19 2003
%t a082186[n_] := Block[{t = Table[0, {n}], i},
%t For[i = 0, i < n, t[[i]] = 1 + Plus @@ PrimeNu /@ Range[i], i++]; t]; a082186[69] (* _Michael De Vlieger_, Dec 24 2014 *)
%Y Equals 1 + A013939.
%K nonn,easy
%O 1,2
%A _Jon Perry_, May 09 2003
%E More terms from _James A. Sellers_, May 19 2003