%I #58 Apr 18 2017 07:03:11
%S 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,
%T 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,
%U 7,7,7,7,7,7,7,7,7,7,7,7,7
%N Constant sequence: the all 7's sequence.
%C a(n) = A153466(n) mod 9. - _Paul Curtz_, Dec 27 2008
%C Continued fraction expansion of A176439. - _Bruno Berselli_, Mar 15 2011
%C 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
%C Decimal expansion of 7/9. - _Arkadiusz Wesolowski_, Sep 12 2011
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=1015">Encyclopedia of Combinatorial Structures 1015</a>
%H Christian Perfect, <a href="http://aperiodical.com/2013/07/integer-sequence-reviews-on-numberphile-or-vice-versa/">Integer sequence reviews on Numberphile (or vice versa)</a>, 2013.
%H <a href="/index/Di#divseq">Index to divisibility sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F G.f.: 7/(1-x). - _Bruno Berselli_, Mar 15 2011
%F a(n) = 7. - _Arkadiusz Wesolowski_, Sep 12 2011
%F E.g.f.: 7*e^x. - _Vincenzo Librandi_, Jan 28 2012
%t ContinuedFraction[(7 + Sqrt@ 53)/2, 105] (* Or *)
%t CoefficientList[ Series[7/(1 - x), {x, 0, 104}], x] (* _Robert G. Wilson v_ *)
%t PadRight[{},90,7] (* or *) Table[7,{90}] (* _Harvey P. Dale_, Jun 05 2013 *)
%o (PARI) a(n)=7 \\ _Charles R Greathouse IV_, Sep 24 2015
%Y Cf. A000012 (the all 1's sequence), A153466, A176439.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_