|
Search: id:A010722
|
|
| |
|
| 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
If A=[A158062] 36*n.^2-2*n (n>0, 34, 140, 318,., ,.,); Y=[A010722] 6 (6, 6, 6,..,); X=[A044518] 36*n-1 (n>0, 35, 71, 107, ,. .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 35^2-34*6^2=1; 71^2-140*6^2=1; 107^2-318*6^2=1. [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 12 2009]
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1014
|
|
CROSSREFS
|
Cf. A158062, A044518 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 12 2009]
Sequence in context: A132726 A165057 A165059 this_sequence A020793 A021019 A082510
Adjacent sequences: A010719 A010720 A010721 this_sequence A010723 A010724 A010725
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
