This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A137290 #15 Apr 20 2023 15:07:59 %S A137290 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 A137290 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 A137290 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 A137290 Fibonacci(n) mod 30. %C A137290 Has period 120. %H A137290 Michel Marcus, <a href="/A137290/b137290.txt">Table of n, a(n) for n = 1..130</a> %H A137290 <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 A137290 Mod[Fibonacci[Range[80]],30] (* _Harvey P. Dale_, Sep 12 2022 *) %o A137290 (PARI) a(n) = fibonacci(n) % 30 \\ _Michel Marcus_, Jun 12 2013 %Y A137290 Cf. A000045, A003893, A007887, A079345, A105471. %K A137290 nonn %O A137290 1,3 %A A137290 Aaron M. Churchill (churchil(AT)math.udel.edu), Mar 15 2008