|
Search: id:A000006
|
|
|
| A000006 |
|
Integer part of square root of n-th prime.
(Formerly M0259 N0092)
|
|
+0
6
|
|
| 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Conjecture: No two successive terms in the sequence differ by more than 1. Proof of this would prove the converse of the theorem that every prime is surrounded by two consecutive squares, namely |sqrt(p)|^2 and (|sqrt(p)|+1)^2. - Cino Hilliard (hillcino368(AT)gmail.com), Jan 22 2003
Equals the number of squares less than prime(n). Cf. A014689. - Zak Seidov (zakseidov(AT)yahoo.com) Nov 04 2007
|
|
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. 2.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].
|
|
MATHEMATICA
|
a[n_] := IntegerPart[Sqrt[Prime[n]]]
|
|
PROGRAM
|
(PARI) a(n)=sqrtint(prime(n)); vector(100, n, a(n))
|
|
CROSSREFS
|
Adjacent sequences: A000003 A000004 A000005 this_sequence A000007 A000008 A000009
Sequence in context: A084500 A084557 A060021 this_sequence A061017 A088462 A093337
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
