login

Revision History for A317746

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
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).
(history; published version)
#37 by Alois P. Heinz at Sat Jun 29 16:57:06 EDT 2024
STATUS

proposed

approved

#36 by Jon E. Schoenfield at Sat Jun 29 16:49:44 EDT 2024
STATUS

editing

proposed

#35 by Jon E. Schoenfield at Sat Jun 29 16:49:37 EDT 2024
NAME

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

COMMENTS

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:

STATUS

approved

editing

#34 by Charles R Greathouse IV at Thu Sep 08 08:46:22 EDT 2022
PROG

(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]]

Discussion
Thu Sep 08
08:46
OEIS Server: https://oeis.org/edit/global/2944
#33 by N. J. A. Sloane at Sun Jan 27 09:43:17 EST 2019
STATUS

editing

approved

#32 by N. J. A. Sloane at Sun Jan 27 09:43:08 EST 2019
NAME

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

STATUS

proposed

editing

Discussion
Sun Jan 27
09:43
N. J. A. Sloane: edited
#31 by M. F. Hasler at Fri Nov 23 21:55:57 EST 2018
STATUS

editing

proposed

Discussion
Thu Jan 17
16:52
Wolfdieter Lang: To Juri-Stepan Gerasimov: In order to map the sequence to the tabf one needs the row lenght (or the difference of them).
#30 by M. F. Hasler at Fri Nov 23 21:53:20 EST 2018
NAME

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.

COMMENTS

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

STATUS

proposed

editing

Discussion
Fri Nov 23
21:55
M. F. Hasler: The NAME is unnecessarily complicated with r and then r = 1. Removed "r" from the title but left it in comments so it is clear that this refers to type-r with r=1.
#29 by Jon E. Schoenfield at Sun Sep 23 22:45:31 EDT 2018
STATUS

editing

proposed

Discussion
Mon Sep 24
15:01
Juri-Stepan Gerasimov: Yes. I agree with your changes.Thanks.
#28 by Jon E. Schoenfield at Sun Sep 23 22:44:23 EDT 2018
COMMENTS

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

STATUS

proposed

editing

Discussion
Sun Sep 23
22:45
Jon E. Schoenfield: @Juri-Stepan -- I'd like to propose some changes to the wording.  What do you think of these changes?