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 A286872 #15 Aug 07 2017 21:26:54
%S A286872 1,5,1,8,1,15,1,6,1,29,1,27,1,5,1,54,1,60,1,6,1,63,1,7,1,6,1,54,1,75,
%T A286872 1,6,1,12,1,52,1,7,1,76,1,69,1,5,1,74,1,27,1,6,1,78,1,12,1,6,1,97,1,
%U A286872 33,1,6,1,15,1,85,1,5,1,99,1,46,1,5,1,15,1,95,1,6,1,56,1,13,1,6,1,82,1,20,1,5
%N A286872 a(n) is the number of terms m such that d((m!)^n) (mod d(m!)) == 0, where d is A000005.
%C A286872 a(1) equals infinity.
%H A286872 Robert G. Wilson v, <a href="/A286872/b286872.txt">Table of n, a(n) for n = 2..1252</a>
%F A286872 a(2n) = 1. a(2n+1) = A286835(n).
%t A286872 factExpLst[nbr_] := factExpLst[nbr] = Table[Plus @@ Rest@ NestWhileList[ Floor[#/prm] &, nbr, # > 0 &], {prm, Prime@ Range@ PrimePi@ nbr}] (* which is the same as Transpose[ FactorInteger[ nbr!]][[2]] *); ds0[nbr_, exp_] := Times @@ (1 + exp*factExpLst[ nbr]); fQ[nbr_, exp_] := Mod[ds0[nbr, exp], ds0[nbr, 1]] == 0; f[n_] := f[n] = If[EvenQ@ n, {1}, Select[Range@ 100000, fQ[#, n] &]]; f[1] = {}; Array[ Length@ f@# &, 70]
%Y A286872 Cf. A286835.
%K A286872 nonn
%O A286872 2,2
%A A286872 _Robert G. Wilson v_, Aug 02 2017