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 A178455 #40 Sep 08 2022 08:45:54 %S A178455 0,0,0,1,3,7,16,34,70,143,289,581,1166,2336,4676,9357,18719,37443, %T A178455 74892,149790,299586,599179,1198365,2396737,4793482,9586972,19173952, %U A178455 38347913,76695835,153391679,306783368,613566746,1227133502 %N A178455 Partial sums of floor(2^n/7). %C A178455 Partial sums of A155803. %H A178455 Vincenzo Librandi, <a href="/A178455/b178455.txt">Table of n, a(n) for n = 0..1000</a> %H A178455 Mircea Merca, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL14/Merca/merca3.html">Inequalities and Identities Involving Sums of Integer Functions</a> J. Integer Sequences, Vol. 14 (2011), Article 11.9.1. %H A178455 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,1,-3,2). %F A178455 a(n) = round((12*2^n - 14*n - 15)/42). %F A178455 a(n) = round((6*2^n - 7*n - 5)/21). %F A178455 a(n) = round((6*2^n - 7*n - 10)/21). %F A178455 a(n) = round((6*2^n - 7*n - 6)/21). %F A178455 a(n) = a(n-3) + 2^(n-2) - 1, n > 2. %F A178455 a(n) = 3*a(n-1) - 2*a(n-2) + a(n-3) - 3*a(n-4) + 2*a(n-5), n > 4. %F A178455 G.f.: -x^3 / ( (2*x-1)*(1 + x + x^2)*(x-1)^2 ). - _R. J. Mathar_, Dec 22 2010 %F A178455 a(n) = floor((2^(n+1))/7) - floor((n+1)/3). - _Ridouane Oudra_, Aug 31 2019 %e A178455 a(6) = 0 + 0 + 0 + 1 + 2 + 4 + 9 = 16. %p A178455 seq(round((6*2^n-7*n-6)/21), n=0..32) %t A178455 Accumulate[Floor[2^Range[0,40]/7]] (* or *) LinearRecurrence[{3,-2,1,-3,2},{0,0,0,1,3},40] (* _Harvey P. Dale_, May 02 2015 *) %o A178455 (Magma) [Round((12*2^n-14*n-15)/42): n in [0..40]]; // _Vincenzo Librandi_, Jun 23 2011 %Y A178455 Cf. A155803. %K A178455 nonn,easy %O A178455 0,5 %A A178455 _Mircea Merca_, Dec 22 2010