Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158392
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158392 a(n)=676*n^2-2*n (n>0) +0
3
674, 2700, 6078, 10808, 16890, 24324, 33110, 43248, 54738, 67580, 81774, 97320, 114218, 132468, 152070, 173024, 195330, 218988, 243998, 270360, 298074, 327140, 357558, 389328, 422450, 456924, 492750, 529928, 568458, 608340, 649574, 692160 (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^2-2*n (n>0)

EXAMPLE

For n=1, a(1)=674; n=2, a(2)=2700; n=3, a(3)=6078

CROSSREFS

Cf. A010865, A158393

Sequence in context: A057802 A047728 A160209 this_sequence A124942 A158393 A159208

Adjacent sequences: A158389 A158390 A158391 this_sequence A158393 A158394 A158395

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research