cp's OEIS Frontend

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.

A130251 Partial sums of A130249.

This page as a plain text file.
%I A130251 #23 Apr 17 2025 23:20:48
%S A130251 0,2,4,7,10,14,18,22,26,30,34,39,44,49,54,59,64,69,74,79,84,90,96,102,
%T A130251 108,114,120,126,132,138,144,150,156,162,168,174,180,186,192,198,204,
%U A130251 210,216,223,230,237,244,251,258,265,272,279,286,293,300,307,314,321
%N A130251 Partial sums of A130249.
%H A130251 G. C. Greubel, <a href="/A130251/b130251.txt">Table of n, a(n) for n = 0..2500</a>
%F A130251 a(n) = Sum_{k=0..n} A130249(k).
%F A130251 a(n) = (n+1)*floor(log_2(3*n+1)) - (1/2)*(A001045(floor(log_2(3*n+1))+2)-1).
%F A130251 G.f.: (1/(1-x)^2)*Sum_{k>=1} x^A001045(k).
%e A130251 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
%t A130251 Join[{0}, Table[Sum[Floor[Log[2, 3*k + 1]], {k, 1, n}], {n, 1, 2500}]] (* _G. C. Greubel_, Sep 09 2018 *)
%o A130251 (PARI) for(n=0,100, print1(sum(k=1,n, floor(log(3*k+1)/log(2))), ", ")) \\ _G. C. Greubel_, Sep 09 2018
%o A130251 (Magma) [0] cat [(&+[Floor(Log(3*k+1)/Log(2)) : k in [1..n]]): n in [1..100]]; // _G. C. Greubel_, Sep 09 2018
%o A130251 (Python)
%o A130251 def A130251(n): return (n+1)*((m:=(3*n+1).bit_length())-1)-(((1<<m+1)|1)//3-1>>1) # _Chai Wah Wu_, Apr 17 2025
%Y A130251 Cf. A130249, A130250, A130252, A130253, A130233, A130235, A130241, A130244. Also A105348, A001045.
%K A130251 nonn
%O A130251 0,2
%A A130251 _Hieronymus Fischer_, May 20 2007