%I A007917
%S A007917 2,3,3,5,5,7,7,7,7,11,11,13,13,13,13,17,17,19,19,19,19,23,23,23,23,23,
               23,
%T A007917 29,29,31,31,31,31,31,31,37,37,37,37,41,41,43,43,43,43,47,47,47,47,47,
               47,
%U A007917 53,53,53,53,53,53,59,59,61,61,61,61,61,61,67,67,67,67,71,71,73,73,73,
               73
%N A007917 Version 1 of the "previous prime" function: largest prime <= n.
%C A007917 Version 2 of the "previous prime" function (see A151799) is "largest 
               prime < n". This produces the same sequence of numerical values, 
               except the offset (or indexing) starts at 3 instead of 2.
%C A007917 Maple's "prevprime" function uses version 2.
%C A007917 Also the largest prime dividing n! or LCM[1,..,n] - Labos E. (labos(AT)ana.sote.hu), 
               Jun 22 2000
%C A007917 Also largest prime among terms of (n+1)st row of Pascal's triangle - 
               Jud McCranie (j.mccranie(AT)comcast.net), Jan 17 2000.
%C A007917 Also largest integer k such that A000203(k)<=n+2 - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Mar 17 2002
%C A007917 Also largest prime factor of A061355(n) (denominator of Sum_{k=0..n} 
               1/k!). - Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Jan 09 
               2005
%C A007917 Also prime(pi(x)) where pi(x) is the prime counting function = number 
               of primes <= x. - Cino Hilliard (hillcino368(AT)gmail.com), May 03 
               2005
%C A007917 Also largest prime factor, occuring to the power p, in denominator of 
               sum(1/k^p,k=1..n), for any positive integer p. - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), 
               Nov 10 2006
%D A007917 K. Atanassov, On the 37-th and the 38-th Smarandache Problems, Notes 
               on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 
               5 (1999), No. 2, 83-85.
%D A007917 J. Castillo, Other Smarandache Type Functions: Inferior/Superior Smarandache 
               f-part of x, Smarandache Notions Journal, Vol. 10, No. 1-2-3, 1999, 
               202-204.
%D A007917 F. Smarandache, Only Problems, not Solutions!, Xiquan Publ., Phoenix-Chicago, 
               1993.
%H A007917 N. J. A. Sloane, <a href="b007917.txt">Table of n, a(n) for n = 2..10000</
               a>
%H A007917 Hans Gunter, <a href="http://primepuzzles.net/puzzles/puzz_145.htm">Puzzle 
               145. The Inferior Smarandache Prime Part and Superior Smarandache 
               Prime Part functions</a>; Solutions by Jean Marie Charrier, Teresinha 
               DaCosta, Rene Blanch, Richard Kelley and Jim Howell.
%H A007917 M. L. Perez et al., eds., <a href="http://www.gallup.unm.edu/~smarandache/
               ">Smarandache Notions Journal</a>
%H A007917 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">
               Only Problems, Not Solutions!</a>.
%H A007917 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PreviousPrime.html">Previous Prime</a>
%F A007917 Equals A006530(A000142(n)). - Jonathan Sondow (jsondow(AT)alumni.princeton.edu), 
               Jan 09 2005
%p A007917 A007917 := n-> prevprime(n+1);
%t A007917 Table[Prime[PrimePi[n]], {n, 2, 70}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               Apr 06 2006
%Y A007917 Cf. A000040, A007918, A151799.
%Y A007917 Sequence in context: A090302 A093074 A136548 this_sequence A151799 A093841 
               A091937
%Y A007917 Adjacent sequences: A007914 A007915 A007916 this_sequence A007918 A007919 
               A007920
%K A007917 nonn,easy,nice
%O A007917 2,1
%A A007917 R. Muller
%E A007917 Edited by N. J. A. Sloane (njas(AT)research.att.com), Apr 06 2008