STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
proposed
approved
editing
proposed
B. Bruno Berselli, A description of the recursive method in Comments lines: website <a href="http://www.lanostra-matematica.org/2008/12/sequenze-numeriche-e-procedimenti.html">Matem@ticamente</a> (in Italian).
a(n) = -Sum_{j=1..8} j*sStirling1(n+1,n+1-j)*SStirling2(n+8-j,n), where s(n,k) and S(n,k) are the Stirling numbers of the first kind and the second kind, respectively. - Mircea Merca, Jan 25 2014
approved
editing
editing
approved
G.f.: x*(x+1)*(x^6 + 246*x^5 + 4047*x^4 + 11572*x^3 + 4047*x^2 + 246*x + 1)/(x-1)^10). - Colin Barker, May 27 2012
approved
editing
editing
approved
a(n) = n*(n+1)*(2*n+1)*(5*n^6 + 15*n^5 + 5*n^4 - 15*n^3 - n^2 + 9*n - 3)/90.
a(n) = n*A000541(n) - sum(Sum_{i=0..n-1} A000541(i), i=0..n-1). - Bruno Berselli, Apr 26 2010
G.f.: x*(x+1)*(x^6 + 246*x^5 + 4047*x^4 + 11572*x^3 + 4047*x^2 + 246*x + 1)/(x-1)^10). - Colin Barker, May 27 2012
a(n) = -sum(Sum_{j=1..8, } j*s(n+1,n+1-j)*S(n+8-j,n)), , where s(n,k) and S(n,k) are the Stirling numbers of the first kind and the second kind, respectively. - Mircea Merca, Jan 25 2014
(Sage) [bernoulli_polynomial(n, 9)/9 for n in range(1, 25)] # - __Zerinvary Lajos_, May 17 2009
approved
editing
editing
approved
for _ in range(10**224):
A000542_list.append(m[-1]) # _Chai Wah Wu_, Nov 05 2014
print(A000542_list) # Chai Wah Wu, Nov 05 2014
proposed
editing
editing
proposed