Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158386
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158386 a(n)=676*n+1 (n>0) +0
3
677, 1353, 2029, 2705, 3381, 4057, 4733, 5409, 6085, 6761, 7437, 8113, 8789, 9465, 10141, 10817, 11493, 12169, 12845, 13521, 14197, 14873, 15549, 16225, 16901, 17577, 18253, 18929, 19605, 20281, 20957, 21633, 22309, 22985, 23661, 24337 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A158385] 676*n.^2+2*n (n>0, 678, 2708, 6090,.,); Y=[A010865] 26 (26, 26, 26, ,.,); X=[A158386] 676*n+1 (n>0, 677, 1353, 2029, .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 677^2-678*26^2=1; 1353^2-2708*26^2=1; 2029^2-6090*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)=677; n=2, a(2)=1353, n=3, a(3)=2029

CROSSREFS

Cf. A010865, A158385

Sequence in context: A058450 A159893 A142755 this_sequence A031614 A031730 A108824

Adjacent sequences: A158383 A158384 A158385 this_sequence A158387 A158388 A158389

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 17 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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research