Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158220
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158220 a(n)=169*n^2+2*n (n>0) +0
3
171, 680, 1527, 2712, 4235, 6096, 8295, 10832, 13707, 16920, 20471, 24360, 28587, 33152, 38055, 43296, 48875, 54792, 61047, 67640, 74571, 81840, 89447, 97392, 105675, 114296, 123255, 132552, 142187, 152160, 162471, 173120, 184107, 195432 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A158220] 169*n.^2+2*n (n>0g 171, 680, 1527, , ,.,); Y=[A010852] 13 (13, 13, 13,.,); X=[A158221] 169*n+1 (n>0, 170, 339, 508, , .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 170^2-171*13^2=1; 339^2-680*13^2=1; 508^2-1527*13^2=1.

LINKS

Wolfram MathWorld, Pell Equation

Edward Everett Withford, Pell Equation

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

FORMULA

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

EXAMPLE

For n=1, a(1)=171; n=2, a(2)=680; n=3, a(3)=1527

CROSSREFS

Cf. A010852, A158221

Sequence in context: A016057 A043407 A031691 this_sequence A079654 A036518 A016058

Adjacent sequences: A158217 A158218 A158219 this_sequence A158221 A158222 A158223

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 14 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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research