|
|
|
|
#19 by Susanna Cuyler at Wed Dec 19 15:05:23 EST 2018
|
|
|
|
#18 by Antti Karttunen at Wed Dec 19 13:39:55 EST 2018
|
|
|
|
#17 by Antti Karttunen at Wed Dec 19 13:18:49 EST 2018
|
|
|
|
#16 by Antti Karttunen at Wed Dec 19 13:02:34 EST 2018
|
| LINKS
|
Antti Karttunen, <a href="/A094756/b094756.txt">Table of n, a(n) for n = 1..20000</a>
|
|
|
|
#15 by Antti Karttunen at Wed Dec 19 13:01:06 EST 2018
|
| LINKS
|
Antti Karttunen, <a href="/A094756/a094756.txt">Data supplement: n, a(n) computed for n = 1..100000</a>
|
|
|
|
#14 by Antti Karttunen at Wed Dec 19 12:55:08 EST 2018
|
| PROG
|
(PARI) A094756(n) = { my(k=1, s1=1, s2=1); while(1, k++; s1 += k; s2 += (k^n); if(!(s2%s1), return(k))); }; \\ Antti Karttunen, Dec 19 2018
|
| STATUS
|
approved
editing
|
|
|
|
#13 by N. J. A. Sloane at Thu Oct 19 10:40:00 EDT 2017
|
|
|
Discussion
|
Thu Oct 19
| 10:40
| OEIS Server: https://oeis.org/edit/global/2705
|
|
|
|
#12 by N. J. A. Sloane at Thu Oct 19 10:38:27 EDT 2017
|
| FORMULA
|
Formulae from _Don Reble: _: If N is not divisible by 2, a(N) = 2.
|
|
|
Discussion
|
Thu Oct 19
| 10:38
| OEIS Server: https://oeis.org/edit/global/2704
|
|
|
|
#11 by Jon E. Schoenfield at Sat Jul 25 00:12:38 EDT 2015
|
|
|
|
#10 by Jon E. Schoenfield at Sat Jul 25 00:12:34 EDT 2015
|
| NAME
|
a(n) = least k>1 such that (1+2+3+...+k) divides (1^n+ + 2^n+ + 3^n +...+ + ... + k^n).
|
| MATHEMATICA
|
f[n_] := Block[{k = 2}, While[ !IntegerQ[ 2Sum[i^n, {i, k}]/(k(k + 1))], k++ ]; k]; Table[ f[n], {n, 50}] (from }] (* _Robert G. Wilson v _, Jun 02 2004) *)
|
| STATUS
|
approved
editing
|
|
|
|