Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158067
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158067 a(n)=64*n^2-2*n (n>0) +0
2
62, 252, 570, 1016, 1590, 2292, 3122, 4080, 5166, 6380, 7722, 9192, 10790, 12516, 14370, 16352, 18462, 20700, 23066, 25560, 28182, 30932, 33810, 36816, 39950, 43212, 46602, 50120, 53766, 57540, 61442, 65472, 69630, 73916, 78330, 82872 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A158067] 64*n.^2-2*n (n>0, 62, 252, 570,.,. ,.,); Y=[A010731] 8 (8,8,8,.,..,); X=[A044631] 64*n-1 (n>0, 63, 127, 191, ,. .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 63^2-62*8^2=1; 127^2-252*8^2=1; 191^2-570*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)=62; n=2, a(2)=252; n=3, a(3)=570

CROSSREFS

Cf. A010731, A044631

Sequence in context: A045274 A045175 A100423 this_sequence A045220 A100158 A100166

Adjacent sequences: A158064 A158065 A158066 this_sequence A158068 A158069 A158070

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research