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 A048744 #42 Jun 07 2021 04:50:17 %S A048744 2,3,9,13,19,21,55,261,3415,4185,7353,12213,44169,60975,61011,108049, %T A048744 182451,228271,481801,500899,505431,1015321,1061095 %N A048744 Numbers k such that 2^k - k is prime. %C A048744 All terms except for the first are odd. - _Joerg Arndt_, Jul 19 2016 %C A048744 From _Iain Fox_, Nov 14 2017: (Start) %C A048744 If k is congruent to 5 mod 6, then 3 divides 2^k - k; therefore a(n) is never congruent to 5 mod 6. %C A048744 For even k, 2^k - k is divisible by 2; thus all terms other than 2 are odd. %C A048744 It follows that for n > 1, a(n) is congruent to {1, 3} mod 6. %C A048744 (End) %D A048744 J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 261, p. 70, Ellipses, Paris 2008. %H A048744 Henri Lifchitz, Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/searchform.php?form=2%5En-n">PRP Top Records.</a> 2^n-n. %e A048744 2^55 - 55 = 36028797018963913 is prime, so 55 is a term. %t A048744 Do[ If[ PrimeQ[ 2^n - n ], Print[ n ] ], {n, 0, 7353} ] %t A048744 (* Second program: *) %t A048744 Select[Range[8000], PrimeQ[2^# - #] &] (* _Michael De Vlieger_, Nov 15 2017 *) %o A048744 (PARI) %o A048744 for(n=1,10^5,if(ispseudoprime(2^n-n),print1(n,", "))) \\ _Derek Orr_, Sep 01 2014 %Y A048744 Cf. A000325, A081296, A052007. %K A048744 nonn,nice,hard,more %O A048744 1,1 %A A048744 _G. L. Honaker, Jr._ %E A048744 261 and 3415 found by _Warut Roonguthai_ %E A048744 4185 and 7353 are probable primes (the latter was found by _Jud McCranie_). %E A048744 12213 found by _Robert G. Wilson v_, Jan 02 2001 %E A048744 More terms from Henri Lifchitz contributed by _Ray Chandler_, Mar 02 2007 %E A048744 Edited by _T. D. Noe_, Oct 30 2008 %E A048744 a(22)-a(23) from _Henri Lifchitz_ contributed by _Robert Price_, Sep 01 2014