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.

A048479 a(n) = T(7,n), array T given by A048472.

This page as a plain text file.
%I A048479 #19 Sep 08 2022 08:44:57
%S A048479 1,9,33,97,257,641,1537,3585,8193,18433,40961,90113,196609,425985,
%T A048479 917505,1966081,4194305,8912897,18874369,39845889,83886081,176160769,
%U A048479 369098753,771751937,1610612737,3355443201,6979321857,14495514625,30064771073,62277025793
%N A048479 a(n) = T(7,n), array T given by A048472.
%C A048479 n-th difference of a(n), a(n-1), ..., a(0) is (8, 16, 24, ...).
%H A048479 Vincenzo Librandi, <a href="/A048479/b048479.txt">Table of n, a(n) for n = 0..1000</a>
%H A048479 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (5,-8,4).
%F A048479 a(n) = 8*n * 2^(n-1) + 1.
%F A048479 a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3) for n>2. G.f.: (1+4*x-4*x^2) / ((1-x)*(1-2*x)^2). - _Colin Barker_, Feb 18 2016
%F A048479 a(n) = Sum_{k=0..n+2} Sum_{i=0..n+2} C(n+1,i) - C(k,i). - _Wesley Ivan Hurt_, Sep 21 2017
%t A048479 Table[8 n*2^(n - 1) + 1, {n, 0, 29}] (* or *)
%t A048479 CoefficientList[Series[(1 + 4 x - 4 x^2)/((1 - x) (1 - 2 x)^2), {x, 0, 29}], x] (* _Michael De Vlieger_, Sep 22 2017 *)
%o A048479 (Magma) [8*n * 2^(n-1) + 1: n in [0..30]]; // _Vincenzo Librandi_, Sep 23 2011
%o A048479 (PARI) Vec((1+4*x-4*x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ _Colin Barker_, Feb 18 2016
%Y A048479 Cf. A048472.
%K A048479 nonn,easy
%O A048479 0,2
%A A048479 _Clark Kimberling_