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 A036899 #16 Jan 01 2017 15:46:16
%S A036899 2,72,2311920,2562840000,3844062000,10617344640,39923436672,
%T A036899 49213207440,72555078960,215073801360,476873804160,719511945840,
%U A036899 972291644352,1567905917760,2012086928880,4707721763712,7251605387280
%N A036899 Products of pairs of consecutive refactorable numbers.
%C A036899 The product of a pair of consecutive refactorable numbers is itself refactorable.
%H A036899 S. Colton, <a href="http://www.cs.uwaterloo.ca/journals/JIS/colton/joisol.html">Refactorable Numbers - A Machine Invention</a>, J. Integer Sequences, Vol. 2, 1999, #2.
%H A036899 S. Colton, <a href="http://web.archive.org/web/20070831060523/http://www.dai.ed.ac.uk/homes/simonco/research/hr/">HR - Automatic Theory Formation in Pure Mathematics</a>
%F A036899 a(n) = A036898(2n) * A036898(2n+1). - _Michel Marcus_, Aug 31 2013
%e A036899 8 and 9 are consecutive refactorable numbers, so 8*9 = 72 is in the sequence.
%o A036899 (PARI) isrefac(n) = ! (n % numdiv(n));
%o A036899 lista(nn) = {for (n=1, nn, if (isrefac(n) && isrefac(n+1), print1(n*(n+1) ", ")););} \\ _Michel Marcus_, Aug 31 2013
%Y A036899 Cf. A033950.
%K A036899 nonn
%O A036899 1,1
%A A036899 Simon Colton (simonco(AT)cs.york.ac.uk)