login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006005 The odd prime numbers together with 1. 56
1, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The odd noncomposite numbers. Also odd primes at the beginning of the 20th century. - Omar E. Pol, Mar 19 2008
Indices at which records occur in A002322. - Artur Jasinski, Apr 05 2008
Odd numbers n such that their largest divisor <= sqrt(n) equals 1. (See A161344). - Omar E. Pol, Aug 03 2009
All k for which cos((k-1)!*Pi/k) is negative. - Gerry Martens, Jun 01 2018
LINKS
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, p. 870 [alternative scanned copy].
S. M. Losanitsch, Die Isomerie-Arten bei den Homologen der Paraffin-Reihe, Chem. Ber. 30 (1897), 1917-1926. (Annotated scanned copy)
FORMULA
a(n) = A000040(n) - A000007(n) = A000040(n) - ((-1)^A000040(n)+1)/2. - Juri-Stepan Gerasimov, Oct 25 2009
a(n) = A175524(n) for n <= 30. - Reinhard Zumkeller, Jul 12 2011
MATHEMATICA
a = {}; max = 0; Do[w = CarmichaelLambda[k]; If[w > max, AppendTo[a, k]; max = k], {k, 1, 200}]; a (* Artur Jasinski, Apr 05 2008 *)
Join[{1}, Prime[Range[2, 60]]] (* Harvey P. Dale, Apr 15 2019 *)
PROG
(PARI) prime(n)-(n==1) \\ Charles R Greathouse IV, Aug 26 2011
CROSSREFS
Sequence in context: A074918 A175524 A073579 * A065091 A160656 A176997
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 15:27 EDT 2024. Contains 372019 sequences. (Running on oeis4.)