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 A286630 #22 Apr 22 2021 08:47:55
%S A286630 1,4,18,150,1470,25410,390390,8678670,184294110,5131136010,
%T A286630 187621103670,6217375194030,274567310987970,12474260804615610,
%U A286630 562558737261811290,28899819781659096270,1727225399291072370690,113442860659098545705130,7154591262923825229979470,526507543922377892743899030,39613798938995626228686492690
%N A286630 a(0) = 1; for n >= 1, a(n) = A000040(n) * A002110(n).
%C A286630 The terms a(0) .. a(5), when viewed in primorial base (A049345) look as: 1, 20, 300, 5000, 70000, E00000, where "E" stands for the digit eleven.
%H A286630 Antti Karttunen, <a href="/A286630/b286630.txt">Table of n, a(n) for n = 0..120</a>
%H A286630 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A286630 a(0) = 1; for n >= 1, a(n) = A000040(n) * A002110(n).
%F A286630 For n >= 1, a(n) = A001248(n) * A002110(n-1) = A002110(n) + A286629(n).
%t A286630 Table[If[n==0, 1, Prime[n] Product[Prime[k], {k, n}]], {n, 0, 100}] (* _Indranil Ghosh_, Jul 07 2017 *)
%o A286630 (Scheme) (define (A286630 n) (if (zero? n) 1 (* (A000040 n) (A002110 n))))
%o A286630 (Python)
%o A286630 from sympy import prime, primorial
%o A286630 def a002110(n): return 1 if n<1 else primorial(n)
%o A286630 def a(n): return 1 if n==0 else prime(n)*a002110(n)
%o A286630 print([a(n) for n in range(41)]) # _Indranil Ghosh_, Jul 07 2017
%o A286630 (PARI) a(n) = if (n==0, 1, prime(n)*prod(k=1, n, prime(k))); \\ _Michel Marcus_, Jul 07 2017
%Y A286630 Cf. A000040, A001248, A002110, A286629.
%Y A286630 Subsequence of A276155.
%K A286630 nonn
%O A286630 0,2
%A A286630 _Antti Karttunen_, Jul 07 2017