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 A181692 #27 Sep 05 2025 10:23:59
%S A181692 2,3,3,4,6,6,8,8,14,12,14,13,20,14,18,24,22,18,20,20,38,24,42,28,32,
%T A181692 32,50,59,34,32,44,32,38,38,36,40,48,42,40,45,48,45,56,45,54,48,76,52,
%U A181692 68,66,100,89,80,74,80,57,66,78,98,83,162,62,166,77,66,77,72,76,74,153,80,89,86,77,94,83,78,88,110,115,84
%N A181692 The smallest positive m such that 2^m-2^n-1 is prime, or 0 if such an m does not exist.
%H A181692 Amiram Eldar, <a href="/A181692/b181692.txt">Table of n, a(n) for n = 0..3000</a>
%p A181692 A181692 := proc(n) for m from n to 100000 do if isprime(2^m-2^n-1) then return m; end if; end do: return 0 ; end proc:
%t A181692 m[n_]:=Module[{m=n+1},While[!PrimeQ[2^m-2^n-1],m++];m]
%t A181692 Table[m[i],{i,0,80}] (* _Harvey P. Dale_, Dec 18 2010 *)
%o A181692 (PARI) for(n=0,80, for(m=n+1,oo, k=2^m-2^n-1; if(isprime(k),print1(m,", "); break))) \\ _Hugo Pfoertner_, Jan 12 2020
%Y A181692 Cf. A096502.
%K A181692 nonn,changed
%O A181692 0,1
%A A181692 _Vladimir Shevelev_, Nov 05 2010
%E A181692 a(12) corrected and sequence extended by _R. J. Mathar_, Nov 17 2010