[go: up one dir, main page]

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!)
Revision History for A231409 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A231409 Least k with 1^(k*m) + 2^(k*m) + ... + (k*m)^(k*m) == k (mod k*m) for m in A230311.
(history; published version)
#11 by Bruno Berselli at Mon Dec 02 10:33:36 EST 2013
STATUS

proposed

approved

#10 by Jonathan Sondow at Sun Dec 01 11:56:19 EST 2013
STATUS

editing

proposed

#9 by Jonathan Sondow at Sun Dec 01 11:56:15 EST 2013
LINKS

Jose María J. M. Grau, A. M. Oller-Marcen, and J. Sondow, <a href="http://arxiv.org/abs/1309.7941">On the congruence 1^m + 2^m + ... + m^m == n (mod m) with n|m</a>, arXiv:1309.7941 [math.NT].

FORMULA

a(2) = A229303(1), a(3) = A229302(1), a(4) = A229301(1), a(5) = A229300, a(6) = A229312(1).

EXAMPLE

1^m + 2^m + ... + m^m == 1 (mod m) for the first 5 terms m = 1, 2, 6, 42, 1806 of A230311, so a(n) = 1 for n <= 5.

CROSSREFS

Cf. A031971, A229300, A229301, A229302, A229303, A230311.

STATUS

approved

editing

#8 by Bruno Berselli at Sun Dec 01 09:18:04 EST 2013
STATUS

proposed

approved

#7 by Joerg Arndt at Sun Dec 01 09:09:39 EST 2013
STATUS

editing

proposed

#6 by Joerg Arndt at Sun Dec 01 09:09:35 EST 2013
LINKS

Jose María Grau, A. M. Oller-Marcen, and J. Sondow, <a href="http://arxiv.org/abs/1309.7941">On the congruence 1^m + 2^m + ... + m^m == n (mod m) with n|m</a>, arXiv 2013:1309.7941 [math.NT].

STATUS

proposed

editing

#5 by Michel Marcus at Sat Nov 30 16:03:55 EST 2013
STATUS

editing

proposed

#4 by Michel Marcus at Sat Nov 30 16:03:45 EST 2013
NAME

Least k with 1^(k*m) + 2^(k*m) + ... + (k*m)^(k*m) == k (mod k*m) for m in A230311.

STATUS

proposed

editing

#3 by Jonathan Sondow at Sat Nov 30 14:37:31 EST 2013
STATUS

editing

proposed

#2 by Jonathan Sondow at Sat Nov 30 14:37:27 EST 2013
NAME

allocatedLeast k with 1^(k*m) + 2^(k*m) + ... + (k*m)^(k*m) == k (mod k*m) for Jonathanm Sondowin A230311.

DATA

1, 1, 1, 1, 1, 5, 5, 39607528021345872635

OFFSET

1,6

COMMENTS

Least k with A031971(k*m) == k (mod k*m) for m in A230311.

See A031971 and A230311 for more comments and crossrefs.

LINKS

Jose María Grau, A. M. Oller-Marcen, and J. Sondow, <a href="http://arxiv.org/abs/1309.7941">On the congruence 1^m + 2^m + ... + m^m == n (mod m) with n|m</a>, arXiv 2013.

EXAMPLE

1^m + 2^m + ... + m^m == 1 (mod m) for the first 5 terms 1, 2, 6, 42, 1806 of A230311, so a(n) = 1 for n <= 5.

CROSSREFS

Cf. A031971, A230311.

KEYWORD

allocated

nonn,more,hard

AUTHOR

Jonathan Sondow, Nov 30 2013

STATUS

approved

editing

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 August 30 05:37 EDT 2024. Contains 375526 sequences. (Running on oeis4.)