|
Search: id:A006005
|
|
|
| A006005 |
|
The odd prime numbers together with 1. |
|
+0
22
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The odd noncomposite numbers. Also odd primes at the beginning of the 20th century. - Omar E. Pol (info(AT)polprimos.com), Mar 19 2008
Indices at which records occur in A002322 - Artur Jasinski (grafix(AT)csl.pl), Apr 05 2008
Odd numbers n such that their largest divisor <= sqrt(n) equals 1. (See A161344). [From Omar E. Pol (info(AT)polprimos.com), Aug 03 2009]
prime(n)-((-1)^prime(n)+1)/2. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 25 2009]
|
|
REFERENCES
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
|
|
LINKS
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
|
|
FORMULA
|
a(n)=A000040(n)-A000007(n)=A000040(n)-((-1)^A000040(n)+1)/2. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 25 2009]
|
|
MATHEMATICA
|
a = {}; max = 0; Do[w = CarmichaelLambda[k]; If[w > max, AppendTo[a, k]; max = k], {k, 1, 200}]; a - Artur Jasinski (grafix(AT)csl.pl), Apr 05 2008
|
|
CROSSREFS
|
Cf. A000040.
Cf. A008578, A065091, A002322.
Cf. A161344. [From Omar E. Pol (info(AT)polprimos.com), Aug 03 2009]
Cf. A000007. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 25 2009]
Sequence in context: A056912 A075763 A074918 this_sequence A065091 A160656 A073579
Adjacent sequences: A006002 A006003 A006004 this_sequence A006006 A006007 A006008
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
