This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161758 a(n)=n-p+1 where p is the maximal prime less than n-2. 0
 4, 4, 5, 4, 5, 4, 5, 6, 7, 4, 5, 4, 5, 6, 7, 4, 5, 4, 5, 6, 7, 4, 5, 6, 7, 8, 9, 4, 5, 4, 5, 6, 7, 8, 9, 4, 5, 6, 7, 4, 5, 4, 5, 6, 7, 4, 5, 6, 7, 8, 9, 4, 5, 6, 7, 8, 9, 4, 5, 4, 5, 6, 7, 8, 9, 4, 5, 6, 7, 4, 5, 4, 5, 6, 7, 8, 9, 4, 5, 6, 7, 4, 5, 6, 7, 8, 9, 4, 5, 6, 7, 8, 9, 10, 11, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,1 COMMENTS By a theorem of Jordan from 1873, a permutation group of degree n is alternating or symmetric if it is a(n)-transitive. For example, a permutation group of degree 100 is alternating or symmetric if it is 4-transitive, since a(100)=100-97+1=4. REFERENCES Camille Jordan, Oeuvres, Volume I, 57. LINKS PROG (PARI) a(n) = n - precprime(n-3) + 1 \\ Michel Marcus, Jun 16 2013 CROSSREFS Sequence in context: A016709 A023403 A091283 * A046566 A046593 A158935 Adjacent sequences:  A161755 A161756 A161757 * A161759 A161760 A161761 KEYWORD nonn AUTHOR David Brink, Jun 18 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 22 22:34 EDT 2019. Contains 328335 sequences. (Running on oeis4.)