This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2017 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A130251 Partial sums of A130249. 11
 0, 2, 4, 7, 10, 14, 18, 22, 26, 30, 34, 39, 44, 49, 54, 59, 64, 69, 74, 79, 84, 90, 96, 102, 108, 114, 120, 126, 132, 138, 144, 150, 156, 162, 168, 174, 180, 186, 192, 198, 204, 210, 216, 223, 230, 237, 244, 251, 258, 265, 272, 279, 286, 293, 300, 307, 314, 321 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..2500 FORMULA a(n) = Sum_{k=0..n} A130249(k). a(n) = (n+1)*floor(log_2(3n+1)) - 1/2*A001045(floor(log_2(3n+1))+2)-1). G.f.: 1/(1-x)^2*Sum{k>=1, x^A001045(k)}. EXAMPLE G.f. = 2*x + 4*x^2 + 7*x^3 + 10*x^4 + 14*x^5 + 18*x^6 + 22*x^7 + ... - Michael Somos, Sep 17 2018 MATHEMATICA Join[{0}, Table[Sum[Floor[Log[2, 3*k + 1]], {k, 1, n}], {n, 1, 2500}]] (* G. C. Greubel, Sep 09 2018 *) PROG (PARI) for(n=0, 100, print1(sum(k=1, n, floor(log(3*k+1)/log(2))), ", ")) \\ G. C. Greubel, Sep 09 2018 (MAGMA) [0] cat [(&+[Floor(Log(3*k+1)/Log(2)) : k in [1..n]]): n in [1..100]]; // G. C. Greubel, Sep 09 2018 CROSSREFS Cf. A130250, A130252, A130253, A130233, A130235, A130241, A130244. Also A105348, A001045. Sequence in context: A273872 A087160 A107427 * A276208 A225635 A256967 Adjacent sequences:  A130248 A130249 A130250 * A130252 A130253 A130254 KEYWORD nonn AUTHOR Hieronymus Fischer, May 20 2007 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 December 9 20:24 EST 2018. Contains 318023 sequences. (Running on oeis4.)