Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158070 a(n)=64*n^2+2*n (n>0) +0
3
66, 260, 582, 1032, 1610, 2316, 3150, 4112, 5202, 6420, 7766, 9240, 10842, 12572, 14430, 16416, 18530, 20772, 23142, 25640, 28266, 31020, 33902, 36912, 40050, 43316, 46710, 50232, 53882, 57660, 61566, 65600, 69762, 74052, 78470, 83016 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A158070] 64*n.^2+2*n (n>0, 66, 260, 582,.,. ,.,); Y=[A010731] 8 (8,8,8,.,..,); X=[A158071] 64*n+1 (n>0, 65, 129, 193, ,. .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 65^2-66*8^2=1; 129^2-260*8^2=1; 193^2-582*8^2=1.

LINKS

Edward Everett Withford, Pell Equation

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

Wolfram MathWorld, Pell Equation

FORMULA

a(n)=64*n^2+2*n (n>0)

EXAMPLE

For n=1, a(1)=66; n=2, a(2)=260; n=3, a(3)=582

CROSSREFS

Cf. A010731, A158071

Sequence in context: A074873 A046393 A117306 this_sequence A120102 A084027 A063249

Adjacent sequences: A158067 A158068 A158069 this_sequence A158071 A158072 A158073

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 12 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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research