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 A338736 #11 Nov 14 2020 09:49:48 %S A338736 0,0,1,1,4,0,3,7,7,4,10,3,9,10,7,15,12,0,10,9,7,4,22,3,1,4,7,1,4,18, %T A338736 30,31,7,4,29,15,1,34,34,39,35,24,29,29,7,4,46,3,1,4,7,29,29,0,21,55, %U A338736 7,54,35,3,45,4,7,63,64,36,2,29,7,4,6,3,43,4,7,29 %N A338736 a(n) = L(L(n)) mod n, where L = Lucas numbers = A000032. %H A338736 Alois P. Heinz, <a href="/A338736/b338736.txt">Table of n, a(n) for n = 1..10000</a> %F A338736 a(n) = A005371(n) mod n. %p A338736 b:= proc(n) local r, M, p; r, M, p:= %p A338736 <<1|0>, <0|1>>, <<0|1>, <1|1>>, n; %p A338736 do if irem(p, 2, 'p')=1 then r:= %p A338736 `if`(nargs=1, r.M, r.M mod args[2]) fi; %p A338736 if p=0 then break fi; M:= %p A338736 `if`(nargs=1, M.M, M.M mod args[2]) %p A338736 od; (r.<<2, 1>>)[1$2] %p A338736 end: %p A338736 a:= n-> (f-> b(f, n) mod n)(b(n)): %p A338736 seq(a(n), n=1..80); %Y A338736 Cf. A000032, A005371, A263112, A338638, A338889. %K A338736 nonn,look %O A338736 1,5 %A A338736 _Alois P. Heinz_, Nov 05 2020