Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157914
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157914 a(n)=8*n^2-1 (n>0) +0
3
7, 31, 71, 127, 199, 287, 391, 511, 647, 799, 967, 1151, 1351, 1567, 1799, 2047, 2311, 2591, 2887, 3199, 3527, 3871, 4231, 4607, 4999, 5407, 5831, 6271, 6727, 7199, 7687, 8191, 8711, 9247, 9799, 10367, 10951, 11551, 12167, 12799, 13447, 14111, 14791 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A157913] 64*n.^2-16 (48, 240, 560,.,); Y=[A000027] n (1, 2, 3, 4, ,.,); X=[A157914] 8*n^2 - 1 (n>0, 7, 31, 71..,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 7^2-48 *1\^2=1; 31^2-240*2^2=1; 71^2-560*3^2=1.

LINKS

Edward Everett Withford, Pell Equation

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

Wolfram MathWorld, Pell Equation

FORMULA

a(n)=8*n^2-1 (n>0)

EXAMPLE

For n=1, a(1)=7; n=2, a(2)=31; n=3, a(3)=71

CROSSREFS

Cf. A000027, A157913

Sequence in context: A163354 A105428 A050547 this_sequence A090684 A033199 A003550

Adjacent sequences: A157911 A157912 A157913 this_sequence A157915 A157916 A157917

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 09 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