|
| |
|
|
A010734
|
|
Constant sequence: the all 9's sequence.
|
|
7
| |
|
|
9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| The digital root of 9^n gives the sequence 1,9,9,9,9,... - Cino Hilliard (hillcino368(AT)gmail.com), Dec 31 2004
Continued fraction expansion of (9+sqrt(85))/2. - Bruno Berselli, Mar 15 2011
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1017
Index entries for sequences related to linear recurrences with constant coefficients, signature (1).
|
|
|
FORMULA
| G.f.: 9/(1-x). - Bruno Berselli, Mar 15 2011
Equals A158289(n) + A199264(n). [Arkadiusz Wesolowski, Nov 30 2011]
E.g.f.: 9*e^x. - Vincenzo Librandi, Jan 26 2012
|
|
|
MATHEMATICA
| Table[9, {81}] (* Arkadiusz Wesolowski, Nov 30 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A137577 A099646 A181693 * A180599 A066568 A106326
Adjacent sequences: A010731 A010732 A010733 * A010735 A010736 A010737
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
