login
a(n) = n mod 15.
2

%I #20 Dec 27 2023 11:20:05

%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,0,1,2,3,4,5,6,7,8,9,10,11,12,13,

%T 14,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,0,1,2,3,4,5,6,7,8,9,10,11,12,

%U 13,14,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,0,1,2,3,4,5,6,7,8,9,10,11,12,13

%N a(n) = n mod 15.

%H Vincenzo Librandi, <a href="/A167463/b167463.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_15">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%F From _R. J. Mathar_, Jun 28 2011: (Start)

%F a(n) = a(n-15).

%F G.f.: -x*(1 +2*x +3*x^2 +4*x^3 +5*x^4 +6*x^5 +7*x^6 +8*x^7 +9*x^8 +10*x^9 +11*x^10 +12*x^11 +13*x^12 +14*x^13) / ( (x-1)*(1+x^4+x^3+x^2+x)*(1+x+x^2)*(1-x+x^3-x^4+x^5-x^7+x^8) ). (End)

%t Table[Mod[n, 15], {n, 0, 50}] (* _G. C. Greubel_, Jun 13 2016 *)

%K nonn,easy

%O 0,3

%A _Zerinvary Lajos_, Nov 04 2009