The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A300905 a(n) = n^sigma(n) mod sigma(n)^n. 1
0, 8, 17, 1978, 73, 0, 1570497, 1009588832, 7390478182, 1391503283200, 166394893969, 151448237549551616, 762517292682713, 18685202394240778240, 814227337406354049, 187036938412352867328077, 947615093635545799201, 2095989269871299377743863001 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
sigma(n) = the sum of the divisors of n (A000203).
n^sigma(n) > sigma(n)^n for all n > 2.
LINKS
FORMULA
a(n) = A100879(n) mod A217872(n).
a(n) = 0 for numbers n in A300906.
If n is a k-perfect number from A007691, then a(n) = 0 iff k divides n.
EXAMPLE
For n = 6; a(6) = 0 because 6^sigma(6) mod sigma(6)^6 = 6^12 mod 12^6 = 2176782336 mod 2985984 = 0.
MAPLE
with(numtheory): seq(n &^ sigma(n) mod sigma(n)^n, n=1..20); # Muniru A Asiru, Mar 20 2018
MATHEMATICA
Array[With[{s = DivisorSigma[1, #]}, PowerMod[#, s, s^#]] &, 18] (* Michael De Vlieger, Mar 16 2018 *)
PROG
(Magma) [n^SumOfDivisors(n) mod SumOfDivisors(n)^n: n in[1..20]]
(PARI) a(n) = my(s=sigma(n)); lift(Mod(n, s^n)^s); \\ Michel Marcus, Mar 17 2018
(GAP) List([1..20], n->PowerModInt(n, Sigma(n), Sigma(n)^n))); # Muniru A Asiru, Mar 20 2018
CROSSREFS
Sequence in context: A248289 A176823 A316199 * A008664 A107779 A018874
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Mar 14 2018
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 June 7 22:01 EDT 2024. Contains 373206 sequences. (Running on oeis4.)