|
| |
|
|
A057062
|
|
Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; the n-th prime is in antidiagonal a(n).
|
|
6
| |
|
|
2, 2, 3, 4, 5, 5, 6, 6, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 15, 16, 16, 17, 17, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24, 25, 25
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The smallest integer in the j-th antidiagonal is A000124(j-1). So a(n) is the index j such that A000124(j-1) <= prime(n) < A000124(j). - R. J. Mathar, Dec 02 2011
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 1..1000
|
|
|
FORMULA
| Round(sqrt(2*prime(n))). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 14 2003
|
|
|
MATHEMATICA
| Table[Round[Sqrt[2*Prime[n]]], {n, 100}] (* T. D. Noe, Dec 03 2011 *)
|
|
|
CROSSREFS
| Cf. A057045, A057048, A022846, A057057, A057054. A066888 counts how many times each positive integer appears in this sequence.
Sequence in context: A136378 A099249 A050296 * A065855 A034137 A156351
Adjacent sequences: A057059 A057060 A057061 * A057063 A057064 A057065
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu), Jul 30 2000
|
| |
|
|
