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.

A162815 a(n) = 8*a(n-1)-13*a(n-2) for n > 1; a(0) = 5, a(1) = 23.

This page as a plain text file.
%I A162815 #7 Sep 08 2022 08:45:46
%S A162815 5,23,119,653,3677,20927,119615,684869,3923957,22488359,128895431,
%T A162815 738814781,4234877645,24274429007,139142022671,797568604277,
%U A162815 4571702539493,26205228460343,150209694669335,861009587370221
%N A162815 a(n) = 8*a(n-1)-13*a(n-2) for n > 1; a(0) = 5, a(1) = 23.
%C A162815 Binomial transform of A162814. Inverse binomial transform of A143647.
%H A162815 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (8,-13)
%F A162815 a(n) = ((5+sqrt(3))*(4+sqrt(3))^n+(5-sqrt(3))*(4-sqrt(3))^n)/2.
%F A162815 G.f.: (5-17*x)/(1-8*x+13*x^2).
%t A162815 LinearRecurrence[{8,-13},{5,23},20] (* _Harvey P. Dale_, Aug 25 2017 *)
%o A162815 (Magma) [ n le 2 select 18*n-13 else 8*Self(n-1)-13*Self(n-2): n in [1..20] ];
%Y A162815 Cf. A162814, A143647.
%K A162815 nonn,easy
%O A162815 0,1
%A A162815 _Klaus Brockhaus_, Jul 18 2009