|
| |
|
|
A010727
|
|
Constant sequence: the all 7's sequence.
|
|
10
| |
|
|
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| a(n)=(submitted A153466=232,610,1600,4192,10978,) mod 9. From A014217=1,1,2,4,6,11 and submitted A153382. [From Paul Curtz (bpcrtz(AT)free.fr), Dec 27 2008]
Continued fraction expansion of (7+sqrt(53))/2. - Bruno Berselli, Mar 15 2011
Final digit of 16^(2^n) + 1. That is, the last digit of every Fermat number F(n) is 7, where n >= 2. [Arkadiusz Wesolowski, Jul 28 2011]
Decimal expansion of 7/9. [Arkadiusz Wesolowski, Sep 12 2011]
|
|
|
LINKS
| Index entries for sequences related to linear recurrences with constant coefficients, signature (1).
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1015
|
|
|
FORMULA
| G.f.: 7/(1-x). - Bruno Berselli, Mar 15 2011
a(n) = 7. [Arkadiusz Wesolowski, Sep 12 2011]
E.g.f.: 7*e^x. - Vincenzo Librandi, Jan 28 2012
|
|
|
MATHEMATICA
| ContinuedFraction[(7 + Sqrt@ 53)/2, 105] (* Or *)
CoefficientList[ Series[7/(1 - x), {x, 0, 104}], x] (* RGWv *)
|
|
|
CROSSREFS
| Sequence in context: A112114 A031182 A106705 * A186684 A108689 A024583
Adjacent sequences: A010724 A010725 A010726 * A010728 A010729 A010730
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
