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!)
A158414 961n + 1. 2
962, 1923, 2884, 3845, 4806, 5767, 6728, 7689, 8650, 9611, 10572, 11533, 12494, 13455, 14416, 15377, 16338, 17299, 18260, 19221, 20182, 21143, 22104, 23065, 24026, 24987, 25948, 26909, 27870, 28831, 29792, 30753, 31714, 32675, 33636 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

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

FORMULA

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

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

MATHEMATICA

LinearRecurrence[{2, -1}, {962, 1923}, 50]

PROG

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

(PARI) a(n) = 961*n + 1.

CROSSREFS

Cf. A158413.

Sequence in context: A231761 A098207 A304315 * A031740 A031529 A031709

Adjacent sequences:  A158411 A158412 A158413 * A158415 A158416 A158417

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 07:59 EDT 2021. Contains 343030 sequences. (Running on oeis4.)