%I #15 Apr 20 2023 15:07:59

%S 1,1,2,3,5,8,13,21,4,25,29,24,23,17,10,27,7,4,11,15,26,11,7,18,25,13,

%T 8,21,29,20,19,9,28,7,5,12,17,29,16,15,1,16,17,3,20,23,13,6,19,25,14,

%U 9,23,2,25,27,22,19,11,0,11,11,22,3,25,28,23,21,14,5,19,24,13,7,20,27,17,14

%N Fibonacci(n) mod 30.

%C Has period 120.

%H Michel Marcus, <a href="/A137290/b137290.txt">Table of n, a(n) for n = 1..130</a>

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

%t Mod[Fibonacci[Range[80]],30] (* _Harvey P. Dale_, Sep 12 2022 *)

%o (PARI) a(n) = fibonacci(n) % 30 \\ _Michel Marcus_, Jun 12 2013

%Y Cf. A000045, A003893, A007887, A079345, A105471.

%K nonn

%O 1,3

%A Aaron M. Churchill (churchil(AT)math.udel.edu), Mar 15 2008