cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A109791 a(n) = prime(n^4).

Original entry on oeis.org

2, 53, 419, 1619, 4637, 10627, 21391, 38873, 65687, 104729, 159521, 233879, 331943, 459341, 620201, 821641, 1069603, 1370099, 1731659, 2160553, 2667983, 3260137, 3948809, 4742977, 5653807, 6691987, 7867547, 9195889, 10688173, 12358069
Offset: 1

Views

Author

Jonathan Vos Post, Aug 14 2005

Keywords

Comments

Since the prime number theorem is the statement that prime[n] ~ n * log n as n -> infinity [Hardy and Wright, page 10] we have a(n) = prime(n^4) is asymptotically (n^4)*log(n^4) = 4*(n^4)*log(n).

Examples

			a(1) = prime(1^4) = 2,
a(2) = prime(2^4) = 53,
a(3) = prime(3^4) = 419, etc.
		

References

  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 2.

Crossrefs

Programs

Formula

a(n) = A000040(A000583(n)) for n > 0.