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.

A164265 Partial sums of A162766.

This page as a plain text file.
%I A164265 #16 Apr 18 2024 06:11:58
%S A164265 4,7,19,28,64,91,199,280,604,847,1819,2548,5464,7651,16399,22960,
%T A164265 49204,68887,147619,206668,442864,620011,1328599,1860040,3985804,
%U A164265 5580127,11957419,16740388,35872264,50221171,107616799,150663520,322850404
%N A164265 Partial sums of A162766.
%H A164265 Vincenzo Librandi, <a href="/A164265/b164265.txt">Table of n, a(n) for n = 1..1000</a>
%H A164265 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,-3).
%F A164265 a(n) = 3*a(n-2)+7 for n > 2; a(1) = 4, a(2) = 7.
%F A164265 a(n) = (11-4*(-1)^n)*3^(1/4*(2*n-1+(-1)^n))/2-7/2.
%F A164265 G.f.: x*(4+3*x)/((1-x)*(1-3*x^2)).
%t A164265 LinearRecurrence[{1,3,-3},{4,7,19},40] (* _Harvey P. Dale_, Aug 28 2016 *)
%o A164265 (Magma) T:=[ n le 2 select 5-n else 3*Self(n-2): n in [1..33] ]; [ n eq 1 select T[1] else Self(n-1)+T[n]: n in [1..#T]];
%o A164265 (PARI) a(n)=if(n%2,15,7)*3^(n\2)\2-3 \\ _Charles R Greathouse IV_, Jul 15 2011
%Y A164265 Cf. A162766, A164123 (partial sums of A162436).
%K A164265 nonn,easy
%O A164265 1,1
%A A164265 _Klaus Brockhaus_, Aug 11 2009