Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158071
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158071 a(n)=64*n+1 ((n>0) +0
3
65, 129, 193, 257, 321, 385, 449, 513, 577, 641, 705, 769, 833, 897, 961, 1025, 1089, 1153, 1217, 1281, 1345, 1409, 1473, 1537, 1601, 1665, 1729, 1793, 1857, 1921, 1985, 2049, 2113, 2177, 2241, 2305, 2369, 2433, 2497, 2561, 2625, 2689, 2753, 2817, 2881 (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

Wolfram MathWorld, Pell Equation

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

Edward Everett Withford, Pell Equation

FORMULA

a(n)=64*n+1 ((n>0)

EXAMPLE

For n=1, a(1)=65; n=2, a(2)=129; n=3, a(3)=193

CROSSREFS

Cf. A158070, A010731

Sequence in context: A118159 A044188 A044569 this_sequence A073631 A092226 A121944

Adjacent sequences: A158068 A158069 A158070 this_sequence A158072 A158073 A158074

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 12 2009

page 1

Search completed in 0.005 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research