|
%I #27 Dec 12 2023 08:23:44
%S 0,0,6,6,3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,6,6,
%T 3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,
%U 6,6,3,3,0,0,6,6,3,3,0,0,6,6,3,3,0,0,6
%N Period 6: repeat [0, 0, 6, 6, 3, 3].
%C Equals A002798 mod 9.
%H Vincenzo Librandi, <a href="/A146761/b146761.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1).
%F From _Richard Choulet_, Dec 02 2008: (Start)
%F a(n+6) = a(n) with a(0)=a(1)=0, a(2)=a(3)=6, a(4)=a(5)=3.
%F O.g.f: f(z)=a(0)+a(1)*z+...=((6*z^2+3*z^4)/((1-z)*(1+z+z^2)*(1-z+z^2))).
%F a(n) = 3-sqrt(3)*sin(2*Pi*n/3)-3*cos(Pi*n/3). (End)
%F a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) for n>4. - _Wesley Ivan Hurt_, Jun 18 2016
%p A146761:=n->[0, 0, 6, 6, 3, 3][(n mod 6)+1]: seq(A146761(n), n=0..100); # _Wesley Ivan Hurt_, Jun 18 2016
%t PadRight[{}, 108, {0,0,6,6,3,3}] (* _Harvey P. Dale_, May 01 2012 *)
%o (Magma) &cat[[0, 0, 6, 6, 3, 3]^^20]; // _Wesley Ivan Hurt_, Jun 18 2016
%Y Cf. A002798.
%K nonn,easy
%O 0,3
%A _Paul Curtz_, Nov 02 2008
|
