OFFSET
1,1
COMMENTS
The identity (361*n+1)^2-(361*n^2+2*n)*(19)^2=1 can be written as A158310(n)^2-a(n)*(19)^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*(19^2*t+2)).
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
a(n) = 3*a(n-1) -3*a(n-2) +a(n-3).
G.f.: x*(363+359*x)/(1-x)^3.
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {363, 1448, 3255}, 50]
PROG
(Magma) I:=[363, 1448, 3255]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]];
(PARI) a(n) = 361*n^2 + 2*n.
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Mar 16 2009
STATUS
approved