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.

A157331 a(n) = 128*n^2 - 32*n + 1.

This page as a plain text file.
%I A157331 #22 May 02 2024 16:12:14
%S A157331 97,449,1057,1921,3041,4417,6049,7937,10081,12481,15137,18049,21217,
%T A157331 24641,28321,32257,36449,40897,45601,50561,55777,61249,66977,72961,
%U A157331 79201,85697,92449,99457,106721,114241,122017,130049,138337,146881,155681,164737,174049,183617
%N A157331 a(n) = 128*n^2 - 32*n + 1.
%C A157331 The identity (128*n^2 - 32*n + 1)^2 - (4*n^2 - n)*(64*n - 8)^2 = 1 can be written as a(n)^2 - A033991(n)*A157330(n)^2 = 1 (see also the second part of the comment at A157330). - _Vincenzo Librandi_, Jan 29 2012
%H A157331 Vincenzo Librandi, <a href="/A157331/b157331.txt">Table of n, a(n) for n = 1..10000</a>
%H A157331 Vincenzo Librandi, <a href="http://mathforum.org/kb/message.jspa?messageID=5773864&amp;tstart=0">X^2-AY^2=1</a>
%H A157331 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A157331 From _Vincenzo Librandi_, Jan 29 2012: (Start)
%F A157331 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
%F A157331 G.f.: x*(-97 - 158*x - x^2)/(x-1)^3. (End)
%F A157331 E.g.f.: exp(x)*(128*x^2 + 96*x + 1) - 1. - _Stefano Spezia_, May 02 2024
%t A157331 LinearRecurrence[{3,-3,1},{97,449,1057},40] (* _Vincenzo Librandi_, Jan 29 2012 *)
%o A157331 (Magma) I:=[97, 449, 1057]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]]; // _Vincenzo Librandi_, Jan 29 2012
%o A157331 (PARI) for(n=1, 40, print1(128*n^2 - 32*n + 1", ")); \\ _Vincenzo Librandi_, Jan 29 2012
%Y A157331 Cf. A033991, A157330.
%K A157331 nonn,easy
%O A157331 1,1
%A A157331 _Vincenzo Librandi_, Feb 27 2009