login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158002 a(n) = 392*n + 1. 2

%I #29 Sep 08 2022 08:45:42

%S 1,393,785,1177,1569,1961,2353,2745,3137,3529,3921,4313,4705,5097,

%T 5489,5881,6273,6665,7057,7449,7841,8233,8625,9017,9409,9801,10193,

%U 10585,10977,11369,11761,12153,12545,12937,13329,13721,14113,14505,14897

%N a(n) = 392*n + 1.

%C The identity (392*n + 1)^2 - (196*n^2 + n)*28^2 = 1 can be written as a(n)^2 - (n*A158223(n))*28^2 = 1. - _Vincenzo Librandi_, Feb 23 2012

%H Vincenzo Librandi, <a href="/A158002/b158002.txt">Table of n, a(n) for n = 0..10000</a> (corrected by Ray Chandler, Jan 19 2019)

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F G.f.: x*(393-x)/(1-x)^2. - _Vincenzo Librandi_, Feb 10 2012

%F a(n) = 2*a(n-1) - a(n-2). - _Vincenzo Librandi_, Feb 10 2012

%t 392Range[40]+1 (* _Harvey P. Dale_, Jul 24 2011 *)

%t LinearRecurrence[{2, -1}, {393, 785}, 50] (* _Vincenzo Librandi_, Feb 10 2012 *)

%o (Magma) I:=[393, 785]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // _Vincenzo Librandi_, Feb 10 2012

%o (PARI) for(n=1, 50, print1(392*n + 1", ")); \\ _Vincenzo Librandi_, Feb 10 2012

%K nonn,easy

%O 0,2

%A _Vincenzo Librandi_, Mar 11 2009

%E Extended to a(0)=1 by _M. F. Hasler_, Jan 04 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)