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.

A177881 Partial sums of round(3^n/10).

This page as a plain text file.
%I A177881 #57 Sep 08 2022 08:45:53
%S A177881 0,0,1,4,12,36,109,328,984,2952,8857,26572,79716,239148,717445,
%T A177881 2152336,6457008,19371024,58113073,174339220,523017660,1569052980,
%U A177881 4707158941,14121476824,42364430472,127093291416
%N A177881 Partial sums of round(3^n/10).
%H A177881 Vincenzo Librandi, <a href="/A177881/b177881.txt">Table of n, a(n) for n = 0..1000</a>
%H A177881 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 A177881 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4,4,-3).
%F A177881 G.f.: x^2/((1 - x)*(1 - 3*x)*(1 + x^2)).
%F A177881 a(n) = round((3*3^n - 3)/20) = round((3*3^n - 5)/20).
%F A177881 a(n) = floor((3*3^n - 1)/20).
%F A177881 a(n) = ceiling((3*3^n - 9)/20).
%F A177881 a(n) = a(n-4) + 4*3^(n-3), n > 3.
%F A177881 a(n) = 4*a(n-1) - 4*a(n-2) + 4*a(n-3) - 3*a(n-4), n > 3.
%F A177881 a(n) = (3^(n+1) + (3 - (-1)^n)*i^(n*(n+1)) - 5)/20, where i = sqrt(-1) - _Bruno Berselli_, May 12 2021
%e A177881 a(4) = 0 + 0 + 1 + 3 + 8 = 12.
%p A177881 A177881 := proc(n) add( round(3^i/10),i=0..n) ; end proc:
%t A177881 Table[(3^(n + 1) + (3 - (-1)^n) i^(n (n + 1)) - 5)/20, {n, 0, 25}] (* _Bruno Berselli_, May 12 2021 *)
%o A177881 (Magma) [Round((3*3^n-3)/20): n in [0..30]]; // _Vincenzo Librandi_, Jun 23 2011
%o A177881 (PARI) a(n)=(3^(n+1)-1)\20 \\ _Charles R Greathouse IV_, Jun 23 2011
%Y A177881 Cf. A015577 (bisection of round(3^n/10)).
%K A177881 nonn,less,easy
%O A177881 0,4
%A A177881 _Mircea Merca_, Dec 28 2010