Jump to content

Faulhaber's formula: Difference between revisions

m
→‎{{header|Python}}: Regularize non-standard header markup
m (Renamed "seq[fraction]" as "FaulhaberSequence".)
m (→‎{{header|Python}}: Regularize non-standard header markup)
Line 2,140:
</pre>
 
== {{header|Python}} ==
 
The following implementation does not use [https://en.wikipedia.org/wiki/Bernoulli_number Bernoulli numbers], but [https://en.wikipedia.org/wiki/Stirling_numbers_of_the_second_kind Stirling numbers of the second kind], based on the relation: <math>m^n=\sum_{k=0}^n S_n^k (m)_k=\sum_{k=0}^n S_n^k k!{m\choose k}</math>.
10,327

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.