login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176147 a(n) = n^sopf(n), where sopf(n) is the sum of the distinct primes dividing n (A008472). 1
1, 4, 27, 16, 3125, 7776, 823543, 64, 729, 10000000, 285311670611, 248832, 302875106592253, 20661046784, 2562890625, 256, 827240261886336764177, 1889568, 1978419655660313589123979, 1280000000, 16679880978201 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n = 1..100

FORMULA

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

EXAMPLE

a(1) = 1^0 = 1;

a(2) = 2^2 = 4;

a(3) = 3^3 = 27;

a(4) = 4^2 = 16.

MATHEMATICA

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

CROSSREFS

Cf. A008472.

Sequence in context: A108139 A351365 A200768 * A176031 A093845 A351747

Adjacent sequences:  A176144 A176145 A176146 * A176148 A176149 A176150

KEYWORD

nonn

AUTHOR

Michel Lagneau, Apr 10 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 04:20 EDT 2022. Contains 353826 sequences. (Running on oeis4.)