This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A046026 Smallest prime p dividing n#-1, n#, or n#+1, n squarefree. 0
 2, 2, 2, 3, 3, 3, 5, 7, 13, 7, 5, 17, 7, 7, 11, 23, 13, 5, 5, 5, 11, 17, 7, 23, 19, 13, 41, 7, 43, 23, 47, 17, 19, 11, 19, 29, 13, 17, 31, 13, 11, 67, 23, 7, 71, 53, 37, 11, 13, 29, 41, 83, 17, 43, 29, 89, 13, 31, 47, 19, 17, 101, 17, 103, 7, 53, 107, 109, 11, 37, 113, 19 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Also called Smarandache near-to-primorial function. REFERENCES Ashbacher, C. A Note on the Smarandache Near-To-Primorial Function.'' {\it Smarandache Notions J.} {\bf 7}, 46-49, 1996. Mudge, M. R. The Smarandache Near-To-Primorial Function.'' {\it Abstracts of Papers Presented to the Amer. Math. Soc.} {\bf 17}, 585, 1996. LINKS Eric Weisstein's World of Mathematics, Smarandache Near-to-Primorial Function FORMULA Smallest prime p such that n divides one of p#-1, p#, p#+1 CROSSREFS Cf. A002110 (primorial numbers), A046027, A013929. Sequence in context: A035449 A161555 A029058 * A139801 A132328 A064822 Adjacent sequences:  A046023 A046024 A046025 * A046027 A046028 A046029 KEYWORD nonn AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .