The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A262998 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A262998

Composite numbers n such that Sum_{k=1..phi(n)} k^phi(n) == phi(n) (mod n), where phi(n) = A000010(n).
(history; published version)

#56 by Michel Marcus at Sat Oct 12 02:52:12 EDT 2024

STATUS

reviewed

approved

#55 by Joerg Arndt at Sat Oct 12 01:52:34 EDT 2024

STATUS

proposed

reviewed

#54 by Michael De Vlieger at Fri Oct 11 17:43:10 EDT 2024

STATUS

editing

proposed

#53 by Michael De Vlieger at Fri Oct 11 17:43:09 EDT 2024

LINKS

Jorma K. Merikoski, Pentti Haukkanen, and Timo Tossavainen, <a href="https://doi.org/10.7546/nntdm.2024.30.3.516-529">The congruence x^n = -a^n (mod m): Solvability and related OEIS sequences</a>, Notes. Num. Theor. Disc. Math. (2024) Vol. 30, No. 3, 516-529. See p. 521.

STATUS

approved

editing

#52 by OEIS Server at Sat Nov 28 13:21:39 EST 2015

LINKS

Robert Israel, <a href="/A262998/b262998_1.txt">Table of n, a(n) for n = 1..5000</a>

#51 by N. J. A. Sloane at Sat Nov 28 13:21:39 EST 2015

STATUS

proposed

approved

Discussion

Sat Nov 28

13:21

OEIS Server: Installed new b-file as b262998.txt.  Old b-file is now b262998_1.txt.

#50 by Thomas Ordowski at Tue Oct 20 07:18:23 EDT 2015

STATUS

editing

proposed

#49 by Thomas Ordowski at Tue Oct 20 07:18:12 EDT 2015

CROSSREFS

Cf. A235137.

#48 by Thomas Ordowski at Tue Oct 20 07:13:31 EDT 2015

NAME

Composite numbers n such that Sum_{k=1^phi(n) + 2^phi(n) + ... + phi(n)} k^phi(n) == phi(n) (mod n), where phi(n) = A000010(n).

STATUS

proposed

editing

#47 by Michel Marcus at Tue Oct 20 03:48:07 EDT 2015

STATUS

editing

proposed

Discussion

Tue Oct 20

07:10

Thomas Ordowski: Rather Sum_{k=1..phi(n)} k^phi(n).