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.

A157325 a(n) = 1728*n + 24.

This page as a plain text file.
%I A157325 #21 Sep 08 2022 08:45:41
%S A157325 1752,3480,5208,6936,8664,10392,12120,13848,15576,17304,19032,20760,
%T A157325 22488,24216,25944,27672,29400,31128,32856,34584,36312,38040,39768,
%U A157325 41496,43224,44952,46680,48408,50136,51864,53592,55320,57048,58776
%N A157325 a(n) = 1728*n + 24.
%C A157325 The identity (10368*n^2 + 288*n + 1)^2 - (36*n^2 + n)*(1728*n + 24)^2 = 1 can be written as A157326(n)^2 - A157324(n)*a(n)^2 = 1 (see also second part of the comment at A157324). - _Vincenzo Librandi_, Jan 26 2012
%H A157325 Vincenzo Librandi, <a href="/A157325/b157325.txt">Table of n, a(n) for n = 1..10000</a>
%H A157325 Vincenzo Librandi, <a href="http://mathforum.org/kb/message.jspa?messageID=5785989&amp;tstart=0">X^2-AY^2=1</a>
%H A157325 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A157325 G.f.: x*(1752 - 24*x)/(1-x)^2. - _Vincenzo Librandi_, Jan 26 2012
%F A157325 a(n) = 2*a(n-1) - a(n-2). - _Vincenzo Librandi_, Jan 26 2012
%t A157325 LinearRecurrence[{2,-1},{1752,3480},50] (* _Vincenzo Librandi_, Jan 26 2012 *)
%t A157325 1728*Range[40]+24 (* _Harvey P. Dale_, Feb 28 2016 *)
%o A157325 (Magma) I:=[1752, 3480]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..40]]; // _Vincenzo Librandi_, Jan 26 2012
%o A157325 (PARI) for(n=1, 22, print1(1728*n + 24", ")); \\ _Vincenzo Librandi_, Jan 26 2012
%Y A157325 Cf. A157324, A157326.
%K A157325 nonn,easy
%O A157325 1,1
%A A157325 _Vincenzo Librandi_, Feb 27 2009