|
%I #24 Dec 12 2023 09:33:39
%S 0,1,2,0,2,4,0,4,3,0,3,1,0,1,2,0,2,4,0,4,3,0,3,1,0,1,2,0,2,4,0,4,3,0,
%T 3,1,0,1,2,0,2,4,0,4,3,0,3,1,0,1,2,0,2,4,0,4,3,0,3,1,0,1,2,0,2,4,0,4,
%U 3,0,3,1,0,1,2,0,2,4,0,4,3,0,3,1,0,1,2,0,2,4,0,4,3,0,3,1,0,1,2,0,2,4,0,4,3
%N Period 12: repeat 0, 1, 2, 0, 2, 4, 0, 4, 3, 0, 3, 1.
%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,1,-1,-1,0,1).
%F O.g.f.: -(x^5+3x^4-x^3-x^2+2x+1)*x/((x-1)(x^2+x+1)(x^4-x^2+1)) . - _R. J. Mathar_, Jan 15 2008
%F a(n+1) = sum(A211313(n, k), k=0..n) mod 5 - _Johannes W. Meijer_, Jul 19 2013
%F a(n) = a(n-2) + a(n-3) - a(n-4) - a(n-5) + a(n-7) for n > 6. - _Chai Wah Wu_, Feb 16 2021
%K nonn,easy
%O 0,3
%A _Paul Curtz_, Sep 25 2007
%E More terms from _R. J. Mathar_, Jan 15 2008
|
