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 A264897 #8 Nov 28 2015 19:17:18
%S A264897 138,163,873,1054,1079,1604,1825,1990,2079,2493,2509,2810,2950,3494,
%T A264897 3800,3910,4300,4462,4470,4564,4593,4957,5140,5450,5558,5572,5581,
%U A264897 5834,6391,6792,6969,7444,7892,8321,8530,8581,9254,9299,9522,9832,9847,10082,10850
%N A264897 Integers n such that A002110(n) is divisible by A098999(n).
%C A264897 A002110(138) has 327 digits.
%C A264897 What is the minimum value of a(n) - a(n-1)?
%t A264897 Select[Range@ 10000, Divisible[Product[Prime@ k, {k, #}], Sum[Prime[k]^3, {k, #}]] &] (* _Michael De Vlieger_, Nov 28 2015 *)
%o A264897 (PARI) for(n=1, 11000, if(prod(k=1, n, prime(k)) % sum(k=1, n, prime(k)^3) == 0, print1(n, ", ")))
%Y A264897 Cf. A002110, A051838, A098999, A122137.
%K A264897 nonn
%O A264897 1,1
%A A264897 _Altug Alkan_, Nov 27 2015