The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066379 Sum of the first n numbers m such that floor(log(m)) divides m. 2
 3, 7, 12, 18, 25, 33, 43, 55, 69, 85, 103, 123, 144, 168, 195, 225, 258, 294, 333, 375, 420, 468, 519, 573, 629, 689, 753, 821, 893, 969, 1049, 1133, 1221, 1313, 1409, 1509, 1613, 1721, 1833, 1949, 2069, 2193, 2321, 2453, 2589, 2729, 2873 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 MAPLE filter:= proc(n) is(n mod floor(log(n)) = 0) end proc: ListTools:-PartialSums(select(filter, [\$3..1000])); # Robert Israel, Sep 04 2015 MATHEMATICA Accumulate@ Select[Range[3, 200], Divisible[#, Floor@ Log@ #] &] (* Michael De Vlieger, Sep 04 2015 *) PROG (PARI) n=0; a=0; for (m=3, 10^9, if (m%floor(log(m)) == 0, a+=m; write("b066379.txt", n++, " ", a); if (n==1000, return))) \\ Harry J. Smith, Feb 12 2010 CROSSREFS Partial sums of A066378. Sequence in context: A141214 A027379 A055998 * A024517 A257941 A257944 Adjacent sequences:  A066376 A066377 A066378 * A066380 A066381 A066382 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 23 2001 EXTENSIONS Name corrected by Charles R Greathouse IV, Sep 04 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 16:20 EST 2021. Contains 349394 sequences. (Running on oeis4.)