|
Search: id:A086914
|
|
|
| A086914 |
|
a(n)=((n-1)^n/n)*sum(k>=1, k^n/n^k). |
|
+0
3
|
|
| 0, 3, 11, 95, 1414, 31619, 980328, 39966975, 2063473712, 131165658459, 10041515879680, 909567637557215, 96070344004816128, 11688399779985830355, 1621144844290431509504, 254042974238965752088575
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Appears to always be an integer.
|
|
FORMULA
|
a(n) = Euler(n, n)/(n-1) where Euler(n, x) is Eulerian polynomial of degree n (cf. A008292). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 26 2003
a(n) = (n-1)^n/n*polylog(-n, 1/n) = 1/(n-1)*Sum(n^i*Sum((-1)^j*binomial(n+1, j)*(i-j+1)^n, j = 0 .. i), i = 0 .. n), n>1. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 26 2003
Prime p divides a(p-1) for p>2. - Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 19 2006
a(n) = A122020[n] / (n*(n-1)) for n>1. a(n) = A122778[n] / (n-1) for n>1. a(n) = ((n-1)^n)/n * A121376[n]/A121985[n] for n>1. - Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 19 2006
|
|
CROSSREFS
|
Cf. A122020, A122778, A121376, A121985.
Adjacent sequences: A086911 A086912 A086913 this_sequence A086915 A086916 A086917
Sequence in context: A063854 A066384 A120587 this_sequence A123996 A008561 A072640
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 24 2003
|
|
|
Search completed in 0.002 seconds
|
