Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158393
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158393 a(n)=676*n-1 (n>0) +0
3
675, 1351, 2027, 2703, 3379, 4055, 4731, 5407, 6083, 6759, 7435, 8111, 8787, 9463, 10139, 10815, 11491, 12167, 12843, 13519, 14195, 14871, 15547, 16223, 16899, 17575, 18251, 18927, 19603, 20279, 20955, 21631, 22307, 22983, 23659, 24335 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A158392] 676*n.^2-2*n (n>0, 674, 2700, 6078,.,); Y=[A010865] 26 (26, 26, 26, ,.,); X=[A158393] 676*n-1 (n>0, 675, 1351, 2027, .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 675^2-674*26^2=1; 1351^2-2700*26^2=1; 2027^2-6078*26^2=1.

LINKS

Edward Everett Withford, Pell Equation

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

Wolfram MathWorld, Pell Equation

FORMULA

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

EXAMPLE

For n=1, a(1)=675; n=2, a(2)=1351; n=3, a(3)=2027

CROSSREFS

Cf. A010865, A158392

Sequence in context: A160209 A158392 A124942 this_sequence A159208 A064963 A059745

Adjacent sequences: A158390 A158391 A158392 this_sequence A158394 A158395 A158396

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research