Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158010 a(n)=256*n^2-n (n>0) +0
2
255, 1022, 2301, 4092, 6395, 9210, 12537, 16376, 20727, 25590, 30965, 36852, 43251, 50162, 57585, 65520, 73967, 82926, 92397, 102380, 112875, 123882, 135401, 147432, 159975, 173030, 186597, 200676, 215267, 230370, 245985, 262112, 278751, 295902 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A158010] 256*n.^2-n (255, 1022, 2301,. ,.,); Y=[A010871] 32 (32, 32, 32,..,); X=[A158011] 512*n-1 (511, 1023, 1535, ,. .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 511^2-255 *32^2=1; 1023^2-1022*32^2=1; 1535^2-2301*32^2=1.

LINKS

Edward Everett Withford, Pell Equation

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

Wolfram MathWorld, Pell Equation

FORMULA

a(n)=256*n^2-n (n>0)

EXAMPLE

For n=1, a1)=255; n=2, a(2)=1022; n=3, a(3)=2301

CROSSREFS

Cf. A010871, A158011

Sequence in context: A045113 A143035 A157778 this_sequence A038995 A068024 A028524

Adjacent sequences: A158007 A158008 A158009 this_sequence A158011 A158012 A158013

KEYWORD

nonn

AUTHOR

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


AT&T Labs Research