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).

This page as a plain text file.
%I A176147 #7 Jul 10 2012 12:22:43
%S A176147 1,4,27,16,3125,7776,823543,64,729,10000000,285311670611,248832,
%T A176147 302875106592253,20661046784,2562890625,256,827240261886336764177,
%U A176147 1889568,1978419655660313589123979,1280000000,16679880978201
%N A176147 a(n) = n^sopf(n), where sopf(n) is the sum of the distinct primes dividing n (A008472).
%H A176147 T. D. Noe, <a href="/A176147/b176147.txt">Table of n, a(n) for n = 1..100</a>
%F A176147 a(n) = n^A008472(n).
%e A176147 a(1) = 1^0 = 1;
%e A176147 a(2) = 2^2 = 4;
%e A176147 a(3) = 3^3 = 27;
%e A176147 a(4) = 4^2 = 16.
%t A176147 Table[n^Total[Transpose[FactorInteger[n]][[1]]], {n, 20}]
%Y A176147 Cf. A008472.
%K A176147 nonn
%O A176147 1,2
%A A176147 _Michel Lagneau_, Apr 10 2010