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 A356211 #12 Aug 24 2022 09:23:16 %S A356211 3,7,13,15,27,29,31,53,57,59,61,63,107,123,127 %N A356211 Odd numbers that cannot be written as a product of an arbitrary number of rational factors of the form 2 + 1/t_k with integers t_k > 1. %C A356211 It is conjectured that there are no further terms. This was checked up to 2^21. %C A356211 If x > 3 is an element of the sequence and y := (x-1)/2 is odd, then y is an element of the sequence. Because if y > 1 is a product of n factors (2 + 1/t_k) with integers t_k > 1, then x = 2*y + 1 = y * (2 + 1/y) is a product of n+1 such factors. %e A356211 1 is not a term because the empty product has the value 1. %e A356211 Other odd numbers that are not terms: %e A356211 5 = (2 + 1/3) * (2 + 1/7); %e A356211 9 = (2 + 1/9) * (2 + 1/ 13) * (2 + 1/19); %e A356211 11 = (2 + 1/3) * (2 + 1/5) * (2 + 1/7); %e A356211 17 = (2 + 1/25) * (2 + 1/27) * (2 + 1/37) * (2 + 1/55); %e A356211 255 = (2 + 1/3)^4 * (2 + 1/7) * (2 + 1/139) * (2 + 1/10633). %o A356211 (PARI) \\ Using the function nTuples from the linked file in A355626 and setting the global variable s: %o A356211 s = 2; L = vector(3815); for (n = 2, 9, forstep (k = 2^n+1, (5/2)^n, 2, my (istup=nTuples(n,k,1,0)); if(istup, L[k]++))); forstep (k=2^10+1, 2^11-1, 2, my (istup=nTuples(10,k,1,0)); if(istup, L[k]++)); forstep (k=3, 2048, 2, if(L[k]==0, print1(k,", "))); %Y A356211 Cf. A355243, A355516, A355626. %K A356211 nonn,more %O A356211 1,1 %A A356211 _Hugo Pfoertner_ and _Markus Sigg_, Aug 16 2022