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.

A064447 a(n) = phi(n^n).

Original entry on oeis.org

1, 2, 18, 128, 2500, 15552, 705894, 8388608, 258280326, 4000000000, 259374246010, 2972033482752, 279577021469772, 4762288639524864, 233543408203125000, 9223372036854775808, 778579070010669895696, 13115469358432179191808, 1874292305362402347591138
Offset: 1

Views

Author

Labos Elemer, Oct 02 2001

Keywords

Examples

			For p prime, a(p) = (p^(p-1))*(p-1) = ((phi(p)+1)^phi(p))*phi(p).
		

Crossrefs

Programs

Formula

a(n) = A000010(A000312(n)).