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 A356210 #12 Aug 02 2024 12:04:29
%S A356210 0,1,11,430,364693
%N A356210 a(n) is the number of tuples (t_1, ..., t_n) with integers 2 <= t_1 <= ... <= t_n such that 2^n + 1 = Product_{i = 1..n} (2 + 1/t_i).
%e A356210 a(1) = 0 trivially;
%e A356210 a(2) = 1 because the only way to express 2^2 + 1 = 5 is (2 + 1/3)*(2 + 1/7);
%e A356210 a(3) = 11: the lexicographically earliest tuple is (5, 23, 517), and the lexicographically latest tuple is (9, 13, 19);
%e A356210 a(4) = 430: lexicographically earliest is (9, 77, 5891, 34700935), lexicographically latest is (25, 27, 37, 55);
%e A356210 a(5) = 364693: lexicographically earliest is (17, 281, 78821, 6212710631, 38597773381434062845), lexicographically latest is (57, 77, 85, 93, 115).
%o A356210 (PARI) \\ see link in A355626; set s=2 and use function a355629(n).
%Y A356210 A355626 provides more information.
%Y A356210 A355629 is the same problem with target 3^n + 1 and factors (3 + 1/t_k).
%Y A356210 Cf. A355243, A355516, A356211.
%K A356210 nonn,hard,more
%O A356210 1,3
%A A356210 _Hugo Pfoertner_ and _Markus Sigg_, Aug 27 2022