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.

A302331 a(0)=1, a(1)=141; for n>1, a(n) = 142*a(n-1) - a(n-2).

This page as a plain text file.
%I A302331 #22 Jul 09 2022 21:48:11
%S A302331 1,141,20021,2842841,403663401,57317360101,8138661470941,
%T A302331 1155632611513521,164091692173449041,23299864656018250301,
%U A302331 3308416689462418093701,469771870039007351055241,66704297128849581431750521,9471540420426601555957518741,1344892035403448571364535910701
%N A302331 a(0)=1, a(1)=141; for n>1, a(n) = 142*a(n-1) - a(n-2).
%H A302331 Colin Barker, <a href="/A302331/b302331.txt">Table of n, a(n) for n = 0..450</a>
%H A302331 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A302331 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (142,-1).
%F A302331 G.f.: (1 - x)/(1 - 142*x + x^2).
%F A302331 a(n) = a(-1-n).
%F A302331 a(n) = cosh((2*n + 1)*arccosh(6))/6.
%F A302331 a(n) = ((6 + sqrt(35))^(2*n + 1) + 1/(6 + sqrt(35))^(2*n + 1))/12.
%F A302331 a(n) = (1/6)*T(2*n+1, 6), where T(n,x) denotes the n-th Chebyshev polynomial of the first kind. - _Peter Bala_, Jul 08 2022
%t A302331 LinearRecurrence[{142, -1}, {1, 141}, 20]
%t A302331 CoefficientList[Series[(1-x)/(1-142x+x^2),{x,0,20}],x] (* _Harvey P. Dale_, Jun 21 2021 *)
%o A302331 (PARI) x='x+O('x^99); Vec((1-x)/(1-142*x+x^2)) \\ _Altug Alkan_, Apr 06 2018
%Y A302331 Sixth row of the array A188646.
%Y A302331 Similar sequences of the type cosh((2*n+1)*arccosh(k))/k are listed in A302329.
%K A302331 nonn,easy
%O A302331 0,2
%A A302331 _Bruno Berselli_, Apr 05 2018