|
%I #44 Feb 21 2024 10:36:38
%S 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
%T 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
%U 8,8,8,8,8,8,8,8,8,8,8,8,8
%N Constant sequence: the all 8's sequence.
%C Continued fraction expansion of 4+sqrt(17). - _Bruno Berselli_, Mar 15 2011
%C Decimal expansion of 8/9. - _Elmo R. Oliveira_, Feb 20 2024
%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=1016">Encyclopedia of Combinatorial Structures 1016</a>
%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.: 8/(1-x). - _Bruno Berselli_, Mar 15 2011
%F E.g.f.: 8*exp(x). - _Elmo R. Oliveira_, Feb 20 2024
%t PadRight[{},120,8] (* _Harvey P. Dale_, Aug 15 2021 *)
%o (PARI) a(n)=8 \\ _Charles R Greathouse IV_, Oct 07 2015
%Y Cf. A136016.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
|
