|
| |
| |
|
|
|
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, 413, 422, 431, 440, 449, 458, 467, 476, 485
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| 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
a(n-1)^2 - A013656(n) * A010701(n)^2 = 1. [From Vincenzo Librandi, Nov 19 2010]
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 970
Index to sequences with linear recurrences with constant coefficients, signature (2,-1).
|
|
|
FORMULA
| a(n) = 18*n-a(n-1)+7. - Vincenzo Librandi, Nov 19 2010
a(0)=8, a(1)=17, a(n) = 2*a(n-1)-a(n-2). G.f.: (8+x)/(1-x)^2. - Colin Barker, Jan 24 2012
|
|
|
MATHEMATICA
| Array[9*#+8&, 100, 0] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 14 2009]
|
|
|
CROSSREFS
| Cf. A013656, A010701.
Sequence in context: A042211 A043485 A031495 * A052222 A044441 A189381
Adjacent sequences: A017254 A017255 A017256 * A017258 A017259 A017260
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
