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.

A051674 a(n) = prime(n)^prime(n).

Original entry on oeis.org

4, 27, 3125, 823543, 285311670611, 302875106592253, 827240261886336764177, 1978419655660313589123979, 20880467999847912034355032910567, 2567686153161211134561828214731016126483469, 17069174130723235958610643029059314756044734431
Offset: 1

Views

Author

Keywords

Comments

Numbers k such that bigomega(k)^(bigomega(k)) = k, where bigomega = A001222. - Lekraj Beedassy, Aug 21 2004
Positive k such that k' = k, where k' is the arithmetic derivative of k. - T. D. Noe, Oct 12 2004
David Beckwith proposes (in the AMM reference): "Let n be a positive integer and let p be a prime number. Prove that (p^p) | n! implies that (p^(p + 1)) | n!". - Jonathan Vos Post, Feb 20 2006
Subsequence of A100716; A003415(m*a(n)) = A129283(m)*a(n), especially A003415(a(n)) = a(n). - Reinhard Zumkeller, Apr 07 2007
A168036(a(n)) = 0. - Reinhard Zumkeller, May 22 2015

Examples

			a(1) = 2^2 = 4.
a(2) = 3^3 = 27.
a(3) = 5^5 = 3125.
		

References

  • J.-M. De Koninck & A. Mercier, 1001 Problemes en Theorie Classique Des Nombres, Problem 740 pp. 95; 312, Ellipses Paris 2004.

Crossrefs

Cf. A000040, A000312, A003415 (arithmetic derivative of n), A129150, A129151, A129152, A048102, A072873 (multiplicative closure), A104126.
Subsequence of A100717; A203908(a(n)) = 0.
Subsequence of A097764.
Cf. A168036, A094289 (decimal expansion of Sum(1/p^p)).

Programs

Formula

a(n) = A000312(A000040(n)). - Altug Alkan, Sep 01 2016
Sum_{n>=1} 1/a(n) = A094289. - Amiram Eldar, Oct 13 2020