|
%I #26 Dec 14 2023 06:05:35
%S 5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,
%T 5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,5,8,
%U 5,8,5,8,5,8,5,8,5,8,5,8,5
%N Period 2: repeat {5,8}.
%C The inverse binomial transform is 5, 3, -6, 12, -24, 48, -96, 192, -384, 768, ... essentially A110164. - _R. J. Mathar_, Feb 25 2023
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F a(n) = a(n-2) for n > 1; a(0) = 5, a(1) = 8. G.f.: (5+8*x)/((1-x)*(1+x)). - _Vincenzo Librandi_, Aug 01 2010
%F a(n) = 3*(n mod 2) + 5. - _Wesley Ivan Hurt_, Jun 14 2014
%p A010719:=n->3*(n mod 2) + 5; seq(A010719(n), n=0..50); # _Wesley Ivan Hurt_, Jun 14 2014
%t Table[3 Mod[n, 2] + 5, {n, 0, 50}] (* _Wesley Ivan Hurt_, Jun 14 2014 *)
%o (Magma) [ 3*(n mod 2) + 5 : n in [0..50] ]; // _Wesley Ivan Hurt_, Jun 14 2014
%Y Cf. A176323.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_, Dec 11 1996
|
