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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126702 a(n) = prime(!n), where !n is subfactorial n. 0
 2, 3, 23, 193, 1697, 15907, 161773, 1777543, 21084257, 269475737, 3696588877, 54223012561, 847458120167, 14065357995331, 247134401977037, 4583801628003613, 89514011909036503, 1836054207193376321 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Table of n, a(n) for n=2..19. Kim Walisch, Fast C++ prime counting function implementation (primecount). FORMULA a(n) = A000040(A000166(n)). - Amiram Eldar, Aug 27 2020 EXAMPLE a(3) = 23,because !4 = 9 and the 9th prime is 23. MATHEMATICA Prime[Subfactorial[Range[2, 15]]] (* Harvey P. Dale, Nov 11 2011 *) CROSSREFS Cf. A000040, A000166, A126701. Sequence in context: A009180 A359840 A041459 * A260126 A260125 A020458 Adjacent sequences: A126699 A126700 A126701 * A126703 A126704 A126705 KEYWORD nonn,hard,more AUTHOR Shyam Sunder Gupta, Feb 11 2007 EXTENSIONS a(16)-a(19) using Kim Walisch's primecount, from Amiram Eldar, Aug 27 2020 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 July 21 10:41 EDT 2024. Contains 374472 sequences. (Running on oeis4.)