proposed
approved
proposed
approved
editing
proposed
Irregular triangle read by rows in which row n lists the divisors k of n such that k^n + n^k == 0 (mod (k + n).
Triangle read by rows in which row n lists the type-1 divisors of n. For each divisor k of n, call k a type-r divisor of n if (r*k)^n + n^(r*k) == 0 (mod (r*k + n), r >= 1.
Triangle read by rows in which row n lists the smallest types r of divisor k of n such that (r*k)^n + n^(r*k) == 0 (mod (r*k + n) begins:
approved
editing
(MAGMAMagma) [[k: k in [ 1..n] | Denominator(n/k) eq 1 and Denominator((k^n+n^k)/(k+n)) eq 1]: n in [1..30]]
editing
approved
Triangle Irregular triangle read by rows in which row n lists the divisors k of n such that k^n + n^k == 0 mod (k + n).
proposed
editing
editing
proposed
Triangle read by rows in which row n lists the divisors k of n such that (r*k)^n + n^(r*k) == 0 mod (r*k + n) with r = 1.
Triangle read by rows in which row n lists the type-1 divisors of n. For each divisor k of n, call k: a type-r divisor of n if (r*k)^n + n^(r*k) == 0 mod (r*k + n), r >= 1.
a type-1 divisor of n if (1*k)^n + n^(1*k) == 0 mod (1*k + n),
a type-2 divisor of n if (2*k)^n + n^(2*k) == 0 mod (2*k + n), ... ,
a type-r divisor of n if (r*k)^n + n^(r*k) == 0 mod (r*k + n).
proposed
editing
editing
proposed
Triangle read by rows in which row n lists the one-type-1 divisors of n. The For each divisor k of n , call ank:
one-a type-1 divisor k of n if (1*k)^n + n^(1*k) == 0 mod (1*k + n),
two-a type-2 divisor k of n if (2*k)^n + n^(2*k) == 0 mod (2*k + n), ... ,
r-a type-r divisor k of n if (r*k)^n + n^(r*k) == 0 mod (r*k + n).
..., where the total number of one-type-1 divisors of n is the sum of the number of all trivial divisors of n and a certain number of nontrivial divisors of n, namely: 1+0, 2+0, 2+0, 2+0, 2+0, 2+1, 2+0, 2+1, 2+1, 2+0, 2+0, 2+2, ...
proposed
editing