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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158133 144n + 1. 2
145, 289, 433, 577, 721, 865, 1009, 1153, 1297, 1441, 1585, 1729, 1873, 2017, 2161, 2305, 2449, 2593, 2737, 2881, 3025, 3169, 3313, 3457, 3601, 3745, 3889, 4033, 4177, 4321, 4465, 4609, 4753, 4897, 5041, 5185, 5329, 5473, 5617, 5761, 5905, 6049, 6193 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The identity (144*n+1)^2-(144*n^2+2*n)*(12)^2=1 can be written as a(n)^2-A158132(n)*(12)^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*(12^2*t+2)).

Index entries for linear recurrences with constant coefficients, signature (2,-1).

FORMULA

a(n) = 2*a(n-1)-a(n-2).

G.f.: x*(145-x)/(1-x)^2.

MATHEMATICA

LinearRecurrence[{2, -1}, {145, 289}, 50]

PROG

(MAGMA) I:=[145, 289]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]];

(PARI) a(n) = 144n + 1.

CROSSREFS

Cf. A158132.

Sequence in context: A176699 A177223 A318530 * A094613 A207058 A116208

Adjacent sequences:  A158130 A158131 A158132 * A158134 A158135 A158136

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Mar 13 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 04:53 EDT 2021. Contains 343937 sequences. (Running on oeis4.)