Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158402
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158402 a(n)=841*n-1 ((n>0) +0
3
840, 1681, 2522, 3363, 4204, 5045, 5886, 6727, 7568, 8409, 9250, 10091, 10932, 11773, 12614, 13455, 14296, 15137, 15978, 16819, 17660, 18501, 19342, 20183, 21024, 21865, 22706, 23547, 24388, 25229, 26070, 26911, 27752, 28593, 29434 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A158401] 841*n.^2-2*n (n>0, 839, 3360, 7563,.,); Y=[A010868] 29 (29, 29, 29, ,.,); X=[A158402] 841*n-1 (n>0, 840, 1681, 2522, .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 840^2-839*29^2=1; 1681^2-3360*29^2=1; 2522^2-7563*29^2=1.

LINKS

Edward Everett Withford, Pell Equation

Vincenzo Librandi, X^2-AY^2=1

Wolfram MathWorld, Pell Equation

FORMULA

a(n)=841*n-1 ((n>0)

EXAMPLE

For n=1, a(1)=840; n=2, a(2)=1681; n=3, a(3)=2522

CROSSREFS

Cf. A010868, A158401

Sequence in context: A068546 A033269 A092002 this_sequence A045477 A005952 A135038

Adjacent sequences: A158399 A158400 A158401 this_sequence A158403 A158404 A158405

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 18 2009

page 1

Search completed in 0.008 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research