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 A339490 #15 Dec 29 2020 07:51:43
%S A339490 1,2,2,4,8,4,8,16,16,40,40,8,12,24,88,176,192,48,64,224,704,896,896,
%T A339490 32,140,72,72,312,312,88,88,176
%N A339490 Number of longest simple paths in the divisor graph of {1,...,n}.
%e A339490 The longest paths for n = 13. The ones marked with (*) are also the longest paths for n = 12.
%e A339490 [5, 10, 2, 8, 4, 12, 6, 3, 9, 1, 7], (*)
%e A339490 [5, 10, 2, 8, 4, 12, 6, 3, 9, 1, 11], (*)
%e A339490 [5, 10, 2, 8, 4, 12, 6, 3, 9, 1, 13],
%e A339490 [7, 1, 5, 10, 2, 8, 4, 12, 6, 3, 9], (*)
%e A339490 [7, 1, 9, 3, 6, 12, 4, 8, 2, 10, 5], (*)
%e A339490 [9, 3, 6, 12, 4, 8, 2, 10, 5, 1, 7], (*)
%e A339490 [9, 3, 6, 12, 4, 8, 2, 10, 5, 1, 11], (*)
%e A339490 [9, 3, 6, 12, 4, 8, 2, 10, 5, 1, 13],
%e A339490 [11, 1, 5, 10, 2, 8, 4, 12, 6, 3, 9], (*)
%e A339490 [11, 1, 9, 3, 6, 12, 4, 8, 2, 10, 5], (*)
%e A339490 [13, 1, 5, 10, 2, 8, 4, 12, 6, 3, 9],
%e A339490 [13, 1, 9, 3, 6, 12, 4, 8, 2, 10, 5].
%Y A339490 Cf. A337125, A339491.
%K A339490 nonn,more,hard
%O A339490 1,2
%A A339490 _Peter Luschny_, Dec 27 2020
%E A339490 a(14)-a(32) from _Pontus von Brömssen_, Dec 29 2020