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 A268613 #11 Jul 06 2025 11:34:27
%S A268613 2,1,3,4,7,11,18,9,7,16,3,19,2,1,3,4,7,11,18,9,7,16,3,19,2,1,3,4,7,11,
%T A268613 18,9,7,16,3,19,2,1,3,4,7,11,18,9,7,16,3,19,2,1,3,4,7,11,18,9,7,16,3,
%U A268613 19,2,1,3,4,7,11,18,9,7,16,3,19,2,1,3,4,7,11,18,9,7,16,3,19,2,1,3,4,7,11,18,9,7,16,3,19,2,1,3,4,7,11
%N A268613 Lucas numbers mod 20.
%C A268613 Sequence of period 12.
%C A268613 This is one of four sequences that are period 12 of the form Lucas[n] Mod x, where x is 8,10,20,40.
%H A268613 G. C. Greubel, <a href="/A268613/b268613.txt">Table of n, a(n) for n = 0..10000</a>
%F A268613 a(n+12) = a(n).
%t A268613 Table[Mod[LucasL[n],20],{n,0,100}]
%t A268613 PadRight[{},120,{2,1,3,4,7,11,18,9,7,16,3,19}] (* _Harvey P. Dale_, Jul 06 2025 *)
%o A268613 (Magma) [Lucas(n) mod 20: n in [0..100]]; // _Vincenzo Librandi_, Feb 09 2016
%Y A268613 Cf. A000032, A111958, A130893.
%K A268613 nonn,easy
%O A268613 0,1
%A A268613 _G. C. Greubel_, Feb 08 2016