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.

A133469 a(n) = a(n-1) + 7*a(n-2) for n >= 2, a(0)=1, a(1)=2.

This page as a plain text file.
%I A133469 #32 Jul 24 2017 08:26:52
%S A133469 1,2,9,23,86,247,849,2578,8521,26567,86214,272183,875681,2780962,
%T A133469 8910729,28377463,90752566,289394807,924662769,2950426418,9423065801,
%U A133469 30076050727,96037511334,306569866423,978832445761,3124821510722
%N A133469 a(n) = a(n-1) + 7*a(n-2) for n >= 2, a(0)=1, a(1)=2.
%H A133469 Robert Israel, <a href="/A133469/b133469.txt">Table of n, a(n) for n = 0..1981</a>
%H A133469 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 7).
%F A133469 G.f.: (1+x)/(1-x-7*x^2) .
%F A133469 a(n) = Sum_{k=0..n+1} A122950(n+1,k)*6^(n+1-k). - _Philippe Deléham_, Jan 08 2008
%F A133469 a(n) = ((29 + 3*sqrt(29))/58)*(0.5 + 0.5*sqrt(29))^n + ((29 - 3*sqrt(29))/58)*(0.5 - 0.5*sqrt(29))^n. - _Richard Choulet_, Nov 20 2008
%p A133469 f:= gfun:-rectoproc({a(n) = a(n-1) + 7*a(n-2), a(0)=1, a(1)=2}, a(n), remember):
%p A133469 map(f, [$0..50]); # _Robert Israel_, Jul 23 2017
%t A133469 LinearRecurrence[{1,7},{1,2},30] (* _Harvey P. Dale_, Dec 09 2013 *)
%o A133469 (PARI) x='x+O('x^99); Vec((1+x)/(1-x-7*x^2)) \\ _Altug Alkan_, Jul 23 2017
%K A133469 easy,nonn
%O A133469 0,2
%A A133469 _Philippe Deléham_, Jan 03 2008