The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158397 729n + 1. 2
 730, 1459, 2188, 2917, 3646, 4375, 5104, 5833, 6562, 7291, 8020, 8749, 9478, 10207, 10936, 11665, 12394, 13123, 13852, 14581, 15310, 16039, 16768, 17497, 18226, 18955, 19684, 20413, 21142, 21871, 22600, 23329, 24058, 24787, 25516, 26245 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The identity (729*n+1)^2-(729*n^2+2*n)*(27)^2=1 can be written as a(n)^2-A158396(n)*(27)^2=1. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 Vincenzo Librandi, X^2-AY^2=1 E. J. Barbeau, Polynomial Excursions, Chapter 10: Diophantine equations (2010), pages 84-85 (row 15 in the first table at p. 85, case d(t) = t*(27^2*t+2)). Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA G.f.: x*(730-x)/(1-x)^2. a(n) = 2*a(n-1)-a(n-2). MATHEMATICA LinearRecurrence[{2, -1}, {730, 1459}, 50] 729*Range[40]+1 (* Harvey P. Dale, Apr 08 2014 *) PROG (MAGMA) I:=[730, 1459]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; (PARI) a(n) = 729*n + 1. CROSSREFS Cf. A158396. Sequence in context: A252526 A044880 A141806 * A031732 A224437 A259322 Adjacent sequences:  A158394 A158395 A158396 * A158398 A158399 A158400 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Mar 18 2009 STATUS approved

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

Last modified January 27 04:57 EST 2020. Contains 331291 sequences. (Running on oeis4.)