The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185191 a(n) = 2^n - second largest prime less than 2^n. 1
 2, 3, 5, 3, 5, 15, 15, 9, 5, 19, 5, 13, 15, 49, 17, 9, 11, 19, 5, 19, 17, 21, 17, 49, 27, 79, 89, 33, 41, 19, 17, 25, 77, 49, 17, 31, 87, 19, 167, 31, 17, 67, 117, 69, 57, 127, 65, 111, 35, 139, 143, 145, 53, 67, 27, 25, 57, 99, 107, 31, 87, 165, 83 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 REFERENCES D. E. Knuth, The Art of Computer Programming Second Edition. Vol. 2, Seminumerical Algorithms. Chapter 4.5.4 Factoring into Primes, Table 1, Page 390, Addison-Wesley, Reading, MA, 1981. LINKS G. C. Greubel, Table of n, a(n) for n = 2..1000 FORMULA a(n) = 2^n - precprime(precprime(2^n)-1) EXAMPLE a(2)=2 because precprime(4)=3, and precprime(2)=2. MATHEMATICA Table[2^n - NextPrime[2^n, -2], {n, 2, 64}] (* T. D. Noe, Jan 24 2012 *) CROSSREFS Cf. A013603. Sequence in context: A209769 A114230 A209753 * A103781 A095244 A147593 Adjacent sequences: A185188 A185189 A185190 * A185192 A185193 A185194 KEYWORD nonn AUTHOR Washington Bomfim, Jan 23 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 2 22:56 EDT 2023. Contains 363102 sequences. (Running on oeis4.)