login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158368 529n + 1. 2
530, 1059, 1588, 2117, 2646, 3175, 3704, 4233, 4762, 5291, 5820, 6349, 6878, 7407, 7936, 8465, 8994, 9523, 10052, 10581, 11110, 11639, 12168, 12697, 13226, 13755, 14284, 14813, 15342, 15871, 16400, 16929, 17458, 17987, 18516, 19045, 19574 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

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

FORMULA

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

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

MATHEMATICA

LinearRecurrence[{2, -1}, {530, 1059}, 50]

529*Range[40]+1 (* Harvey P. Dale, Nov 02 2017 *)

PROG

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

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

CROSSREFS

Cf. A158367.

Sequence in context: A013773 A013907 A048455 * A250795 A031724 A251004

Adjacent sequences:  A158365 A158366 A158367 * A158369 A158370 A158371

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Mar 17 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 July 17 16:38 EDT 2019. Contains 325107 sequences. (Running on oeis4.)