|
%I #14 Aug 21 2022 17:49:34
%S 0,1,3,0,4,3,3,4,0,3,1,0,0,1,3,0,4,3,3,4,0,3,1,0,0,1,3,0,4,3,3,4,0,3,
%T 1,0,0,1,3,0,4,3,3,4,0,3,1,0,0,1,3,0,4,3,3,4,0,3,1,0,0,1,3,0,4,3,3,4,
%U 0,3,1,0,0,1,3,0,4,3,3,4,0,3,1,0,0,1,3
%N a(n) = n*(n+1)/2 (mod 6).
%H <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1,0,0,-1,0,0,1)
%F a(n) = A010875(A000217(n)). - _Arkadiusz Wesolowski_, Nov 28 2011
%F G.f.: -x*(1+3*x+3*x^3+3*x^5+x^6) / ( (x-1)*(1+x+x^2)*(x^2+1)*(x^4-x^2+1) ). - _R. J. Mathar_, Oct 16 2015
%t Table[Mod[(n^2 + n)/2, 6], {n, 0, 100}] (* _Arkadiusz Wesolowski_, Nov 28 2011 *)
%t Mod[Accumulate[Range[0,90]],6] (* or *) LinearRecurrence[{0,0,1,0,0,-1,0,0,1},{0,1,3,0,4,3,3,4,0},90] (* _Harvey P. Dale_, Aug 21 2022 *)
%K easy,nonn
%O 0,3
%A Stuart M. Ellerstein (ellerstein(AT)aol.com), Apr 22 2005
|
