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 A361505 #19 Mar 19 2023 10:38:59 %S A361505 1,2,5,10,24,38,87,172,349,706,1407,2752,5487,11103,22285,44429,88993, %T A361505 177746,356460,712129,1425163,2849424,5701776,11401709,22804522, %U A361505 45608572,91219022,182438457,364879209,729757797,1459514883,2919031155,5838065175,11676129412,23352260426 %N A361505 Index of 2^n in A359804. %H A361505 Rémy Sigrist, <a href="/A361505/a361505.txt">C++ program</a> %t A361505 nn = 2^20; c[_] = False; q[_] = 1; %t A361505 i = 1; j = 2; c[1] = c[2] = True; u = 3; %t A361505 {1, 2}~Join~Reap[Monitor[Do[ %t A361505 (k = q[#]; While[c[k #], k++]; k *= #; %t A361505 While[c[# q[#]], q[#]++]) &[(p = 2; %t A361505 While[Divisible[i j, p], p = NextPrime[p]]; p)]; %t A361505 If[IntegerQ@ Log2[k], Sow[n]]; %t A361505 Set[{c[k], i, j}, {True, j, k}]; %t A361505 If[k == u, While[c[u], u++]], {n, 3, nn}], n]][[-1, -1]] (* _Michael De Vlieger_, Mar 18 2023 *) %o A361505 (C++) See Links section. %Y A361505 Cf. A359804, A361502, A361504. %K A361505 nonn %O A361505 0,2 %A A361505 _N. J. A. Sloane_, Mar 18 2023 %E A361505 a(26)-a(27) from _Michael De Vlieger_, Mar 19 2023 %E A361505 More terms from _Rémy Sigrist_, Mar 19 2023