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.

A162759 a(n) = 16*a(n-1)-61*a(n-2) for n > 1; a(0) = 1, a(1) = 9.

This page as a plain text file.
%I A162759 #7 Sep 08 2022 08:45:46
%S A162759 1,9,83,779,7401,70897,682891,6601539,63968273,620798489,6030711171,
%T A162759 58622670907,570089353081,5545446723969,53951697045563,
%U A162759 524954902566899,5108224921291041,49709349684075817,483747874746459571
%N A162759 a(n) = 16*a(n-1)-61*a(n-2) for n > 1; a(0) = 1, a(1) = 9.
%C A162759 Eighth binomial transform of A108411. Binomial transform of A162758.
%H A162759 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (16, -61).
%F A162759 a(n) = ((3+sqrt(3))*(8+sqrt(3))^n+(3-sqrt(3))*(8-sqrt(3))^n)/6.
%F A162759 G.f.: (1-7*x)/(1-16*x+61*x^2).
%t A162759 LinearRecurrence[{16,-61},{1,9},30] (* _Harvey P. Dale_, Jan 18 2014 *)
%o A162759 (Magma) [ n le 2 select 8*n-7 else 16*Self(n-1)-61*Self(n-2): n in [1..19] ];
%Y A162759 Cf. A108411 (powers of 3 repeated), A162758.
%K A162759 nonn
%O A162759 0,2
%A A162759 _Klaus Brockhaus_, Jul 13 2009