|
| |
|
|
A007917
|
|
Version 1 of the "previous prime" function: largest prime <= n.
|
|
115
|
|
|
|
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, 29, 29, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 41, 41, 43, 43, 43, 43, 47, 47, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 59, 59, 61, 61, 61, 61, 61, 61, 67, 67, 67, 67, 71, 71, 73, 73, 73, 73
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
2,1
|
|
|
COMMENTS
|
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.
Maple's "prevprime" function uses version 2.
Also the largest prime dividing n! or lcm(1,...,n). - Labos Elemer, Jun 22 2000
Also largest prime among terms of (n+1)st row of Pascal's triangle. - Jud McCranie, Jan 17 2000
Also prime(pi(x)) where pi(x) is the prime counting function = number of primes <= x. - Cino Hilliard, May 03 2005
Also largest prime factor, occurring to the power p, in denominator of Sum_{k=1..n} 1/k^p, for any positive integer p. - M. F. Hasler, Nov 10 2006
For n > 10, these values are close to the most negative eigenvalues of A191898 (conjecture). - Mats Granvik, Nov 04 2011
|
|
|
REFERENCES
|
K. Atanassov, On the 37th and the 38th Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 5 (1999), No. 2, 83-85.
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.
|
|
|
LINKS
|
|
|
|
FORMULA
|
omega( Product_{i=2..n} a(i) ) = pi(n).
Omega( Product_{i=2..n} a(i) ) = n - 1. (End)
|
|
|
MAPLE
|
|
|
|
MATHEMATICA
|
|
|
|
PROG
|
(PARI) a=precprime \\ In older versions, use a(n)=precprime(n)
(Haskell)
a007917 n = if a010051' n == 1 then n else a007917 (n-1)
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
|
AUTHOR
|
R. Muller
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
