Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007917
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007917 Version 1 of the "previous prime" function: largest prime <= n. +0
57
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; listen)
OFFSET

2,1

COMMENT

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 E. (labos(AT)ana.sote.hu), Jun 22 2000

Also largest prime among terms of (n+1)st row of Pascal's triangle - Jud McCranie (j.mccranie(AT)comcast.net), Jan 17 2000.

Also largest integer k such that A000203(k)<=n+2 - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 17 2002

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

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

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

REFERENCES

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.

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.

F. Smarandache, Only Problems, not Solutions!, Xiquan Publ., Phoenix-Chicago, 1993.

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 2..10000

Hans Gunter, Puzzle 145. The Inferior Smarandache Prime Part and Superior Smarandache Prime Part functions; Solutions by Jean Marie Charrier, Teresinha DaCosta, Rene Blanch, Richard Kelley and Jim Howell.

M. L. Perez et al., eds., Smarandache Notions Journal

F. Smarandache, Only Problems, Not Solutions!.

Eric Weisstein's World of Mathematics, Previous Prime

FORMULA

Equals A006530(A000142(n)). - Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Jan 09 2005

MAPLE

A007917 := n-> prevprime(n+1);

MATHEMATICA

Table[Prime[PrimePi[n]], {n, 2, 70}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 06 2006

CROSSREFS

Cf. A000040, A007918, A151799.

Sequence in context: A090302 A093074 A136548 this_sequence A151799 A093841 A091937

Adjacent sequences: A007914 A007915 A007916 this_sequence A007918 A007919 A007920

KEYWORD

nonn,easy,nice

AUTHOR

R. Muller

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Apr 06 2008

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research