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!)
A238981 Sum of n-th powers of unitary divisors of n (d such that d divides n, gcd(d, n/d) = 1). 3

%I #38 Apr 28 2023 16:40:28

%S 1,5,28,257,3126,47450,823544,16777217,387420490,10009766650,

%T 285311670612,8916117756914,302875106592254,11112685048647250,

%U 437893920912786408,18446744073709551617,827240261886336764178,39346558169931834836690,1978419655660313589123980

%N Sum of n-th powers of unitary divisors of n (d such that d divides n, gcd(d, n/d) = 1).

%H Amiram Eldar, <a href="/A238981/b238981.txt">Table of n, a(n) for n = 1..387</a>

%F For prime p, a(p) = p^p + 1; A125137 is a subsequence. - _Michel Marcus_, Nov 20 2015

%F a(n) = n^n+1 (A014566) if n is a prime power (A246655). - _Michel Marcus_, Nov 21 2015

%F a(n) = Sum_{d|n, gcd(d,n/d)=1} d^n. - _Wesley Ivan Hurt_, Apr 28 2023

%t a[n_, k_] := Sum[If[GCD[i, n] == i && GCD[i, n/i] == 1, i^k, 0], {i, n}]; Table[a[n, n], {n, 1, 24}]

%t a[1] = 1; a[n_] := Times @@ (1 + First[#]^(n * Last[#]) &/@ FactorInteger[n]); Array[a, 19] (* _Amiram Eldar_, Aug 10 2019 *)

%o (PARI) a(n) = sumdiv(n, d, d^n*(gcd(d, n/d) == 1)); \\ _Michel Marcus_, Mar 19 2014

%Y Cf. A034448, A238982, A238983.

%K nonn

%O 1,2

%A _José María Grau Ribas_, Mar 07 2014

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 March 28 11:46 EDT 2024. Contains 371241 sequences. (Running on oeis4.)