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 A268615 #10 Sep 08 2022 08:46:15
%S A268615 2,1,3,4,7,11,18,29,7,36,3,39,2,1,3,4,7,11,18,29,7,36,3,39,2,1,3,4,7,
%T A268615 11,18,29,7,36,3,39,2,1,3,4,7,11,18,29,7,36,3,39,2,1,3,4,7,11,18,29,7,
%U A268615 36,3,39,2,1,3,4,7,11,18,29,7,36,3,39,2,1,3,4,7,11,18,29,7,36,3,39,2,1,3,4,7,11,18,29,7,36,3,39,2,1,3,4,7,11
%N A268615 Lucas numbers mod 40.
%C A268615 This sequence is of period 12.
%C A268615 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 A268615 G. C. Greubel, <a href="/A268615/b268615.txt">Table of n, a(n) for n = 0..10000</a>
%F A268615 a(n+12) = a(n).
%t A268615 Table[Mod[LucasL[n],40], {n,0,100}]
%t A268615 PadRight[{},120,{2,1,3,4,7,11,18,29,7,36,3,39}] (* _Harvey P. Dale_, Feb 04 2019 *)
%o A268615 (Magma) [Lucas(n) mod 40: n in [0..100]]; // _Vincenzo Librandi_, Feb 09 2016
%Y A268615 Cf. A000032, A111958, A130893, A268613.
%K A268615 nonn,easy
%O A268615 0,1
%A A268615 _G. C. Greubel_, Feb 08 2016