|
| |
|
|
A072633
|
|
Smallest positive integer m where 1^n+2^n+3^n+...+m^n is greater than or equal to (m+1)^n.
|
|
1
| |
|
|
1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 15, 17, 18, 20, 21, 23, 24, 26, 27, 28, 30, 31, 33, 34, 36, 37, 39, 40, 41, 43, 44, 46, 47, 49, 50, 51, 53, 54, 56, 57, 59, 60, 62, 63, 64, 66, 67, 69, 70, 72, 73, 75, 76, 77, 79, 80, 82, 83, 85, 86, 88, 89, 90, 92, 93, 95, 96, 98, 99, 101
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| The two trivial cases of equality are n=0, m=1 and n=1, m=2, i.e. 1^0=2^0 and 1^1+2^1=3^1. The references state that there are no other equalities for m<10^2000000.
|
|
|
REFERENCES
| R. K. Guy, Unsolved Problems in Number Theory, D10.
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
|
EXAMPLE
| a(3)=5 since 1^3+2^3+3^3+4^3<5^3 but 1^3+2^3+3^3+4^3+5^3>=6^3, i.e. since 100<125 but 225>=216.
|
|
|
MATHEMATICA
| (* Assuming sequence is increasing : *) a[0] = 1; a[n_] := a[n] = (m = a[n-1]; While[ True, m++; If[ Sum[ k^n, {k, 1, m}] >= (m+1)^n, Break[]]]; m); Table[ a[n], {n, 0, 69}] (* From Jean-François Alcover, Oct 03 2011 *)
|
|
|
CROSSREFS
| Close to A037087 (offset).
Sequence in context: A056127 A186352 A186157 * A037087 A194145 A189784
Adjacent sequences: A072630 A072631 A072632 * A072634 A072635 A072636
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Henry Bottomley (se16(AT)btinternet.com), Jun 28 2002
|
| |
|
|
