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 A318660 #20 Sep 23 2018 21:31:46
%S A318660 0,1,2,1,1,3,3,3,7,3,9,9,2,9,10,1,8,3,10,19,1,5,14,15,21,19,17,13,22,
%T A318660 15,3,19,23,7,12,9,9,11,10,17,15,3,19,15,5,19,23,21,44,13,40,5,29,51,
%U A318660 11,11,50,37,41,15,39,9,47,25,61,3,63,55,1,1,69,27,2,27,5,71,65,69,6,11,58,45,16,9,54,57,23,45,16,15,60,11,77,69
%N A318660 Remainder when A064988(n) is divided by n.
%C A318660 Inspired by A064988 and a 'minimum' version of it (A318871).
%C A318660 a(n) = 0 only for n = 1. Numbers n such that a(n) = 1 are 2, 4, 5, 16, 21, 69, 70, 181, 265, 370, 1043, 3760, 4531, ...
%H A318660 Antti Karttunen, <a href="/A318660/b318660.txt">Table of n, a(n) for n = 1..65537</a>
%F A318660 a(n) = A064988(n) mod n.
%F A318660 a(A000040(n)) = A076240(n).
%e A318660 a(6) = prime(2)*prime(3) mod 6 = 15 mod 6 = 3.
%t A318660 Table[Mod[If[n == 1, 1, Apply[Times, FactorInteger[n] /. {p_, e_} /; p > 1 :> Prime[p]^e]], n], {n, 94}] (* _Michael De Vlieger_, Sep 10 2018 *)
%o A318660 (PARI) A318660(n) = { my(f = factor(n)); for (k=1, #f~, f[k, 1] = prime(f[k, 1]); ); (factorback(f)%n); }; \\ After code in A064988.
%Y A318660 Cf. A064988, A076240, A318668, A318871.
%K A318660 nonn
%O A318660 1,3
%A A318660 _Altug Alkan_ and _Antti Karttunen_, Sep 08 2018