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