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.

A176147 a(n) = n^sopf(n), where sopf(n) is the sum of the distinct primes dividing n (A008472).

Original entry on oeis.org

1, 4, 27, 16, 3125, 7776, 823543, 64, 729, 10000000, 285311670611, 248832, 302875106592253, 20661046784, 2562890625, 256, 827240261886336764177, 1889568, 1978419655660313589123979, 1280000000, 16679880978201
Offset: 1

Views

Author

Michel Lagneau, Apr 10 2010

Keywords

Examples

			a(1) = 1^0 = 1;
a(2) = 2^2 = 4;
a(3) = 3^3 = 27;
a(4) = 4^2 = 16.
		

Crossrefs

Cf. A008472.

Programs

  • Mathematica
    Table[n^Total[Transpose[FactorInteger[n]][[1]]], {n, 20}]

Formula

a(n) = n^A008472(n).