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 A083396 #5 Dec 15 2017 17:36:19
%S A083396 4,6,4,6,4,9,21,9,169,15,121,25,9,21,289,221,15,253,209,9,247,143,253,
%T A083396 121,341,169,323,437,319,187,299,649,121,221,253,49,377,247,143,209,
%U A083396 391,169,35,121,209,299,49,25,221,21,187,143,15,35,143,9,209,377,25,49,21
%N A083396 Least n such that n and 2k+n are both brilliant numbers.
%C A083396 Conjecture: for any k >= 1 there will always be a brilliant constellation of the form {n, 2k+n} for some n. (True for all k <= 5000.)
%e A083396 a(9)=169 because 169=13*13 and 169+18=11*17.
%Y A083396 Cf. A078972, A083284, A083285.
%K A083396 base,nonn
%O A083396 1,1
%A A083396 _Jason Earls_, Jun 06 2003