|
Search: id:A017257
|
|
| |
|
| 8, 17, 26, 35, 44, 53, 62, 71, 80, 89, 98, 107, 116, 125, 134, 143, 152, 161, 170, 179, 188, 197, 206, 215, 224, 233, 242, 251, 260, 269, 278, 287, 296, 305, 314, 323, 332, 341, 350, 359, 368, 377, 386, 395, 404
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Digital root of any number in this sequence = 8. Any partial sum of digits of any number in this sequence also belongs to this sequence. - Artur Jasinski (grafix(AT)csl.pl), Dec 16 2007
If A=[A013656] 9*n.^2-2*n (n>0, 7, 32, 75,., ,.,); Y=[A010701] 3 (3, 3, 3, ,..,); X=[A017257] 9*n-1 (n>0, 8, 17, 26, 35, ,. .,), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 8^2-7 *3^2=1; 17^2-32*3^2=1; 26^2-75*3^2=1. [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 11 2009]
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 970
|
|
MATHEMATICA
|
Array[9*#+8&, 100, 0] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 14 2009]
|
|
PROGRAM
|
(Other) sage: [i+8 for i in range(405) if gcd(i, 9) == 9] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
|
|
CROSSREFS
|
Cf. A013656, A010701 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 11 2009]
Sequence in context: A042211 A043485 A031495 this_sequence A052222 A044441 A056121
Adjacent sequences: A017254 A017255 A017256 this_sequence A017258 A017259 A017260
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
