|
Search: id:A010855
|
|
| |
|
| 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
If A=[A158249] 256*n.^2-2*n (n>0, 254, 1020, 2298, ,. ,.,); Y=[A010855] 16 (16, 16, 16, ,.,); X=[A158250] 256*n-1 (n>0, 255, 511, 767, , .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 255^2-254*16^2=1; 511^2-1020*16^2=1;767^2-2298*16^2=1. [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 15 2009]
If A=[A158230] 256*n.^2+2*n (n>0, 258, 1028, 2310, ,. ,.,); Y=[A010855] 16 (16, 16, 16, ,.,); X=[A158231] 256*n+1 (n>0, 257, 513, 769, , .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 257^2-258*16^2=1; 513^2-1028*16^2=1;769^2-2310*16^2=1. [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 14 2009]
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
CROSSREFS
|
Cf. A158249, A158250 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 15 2009]
Cf. A158230, A158231 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 14 2009]
Sequence in context: A023458 A070576 A103908 this_sequence A040241 A022350 A087970
Adjacent sequences: A010852 A010853 A010854 this_sequence A010856 A010857 A010858
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
