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.

A162758 a(n) = 14*a(n-1)-46*a(n-2) for n > 1; a(0) = 1, a(1) = 8.

This page as a plain text file.
%I A162758 #8 Sep 08 2022 08:45:46
%S A162758 1,8,66,556,4748,40896,354136,3076688,26783376,233439616,2036119328,
%T A162758 17767448256,155082786496,1353856391168,11820181297536,
%U A162758 103205144171776,901143678718208,7868574870153216,68707438961107456,599949701428456448
%N A162758 a(n) = 14*a(n-1)-46*a(n-2) for n > 1; a(0) = 1, a(1) = 8.
%C A162758 Seventh binomial transform of A108411. Binomial transform of A162757. Inverse binomial transform of A162759.
%H A162758 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (14, -46).
%F A162758 a(n) = ((3+sqrt(3))*(7+sqrt(3))^n+(3-sqrt(3))*(7-sqrt(3))^n)/6.
%F A162758 G.f.: (1-6*x)/(1-14*x+46*x^2).
%t A162758 LinearRecurrence[{14,-46},{1,8},30] (* _Harvey P. Dale_, Apr 09 2012 *)
%o A162758 (Magma) [ n le 2 select 7*n-6 else 14*Self(n-1)-46*Self(n-2): n in [1..20] ];
%Y A162758 Cf. A108411 (powers of 3 repeated), A162757, A162759.
%K A162758 nonn
%O A162758 0,2
%A A162758 _Klaus Brockhaus_, Jul 13 2009