Faulhaber's formula: Difference between revisions

</pre>

 

<lang python>from fractions import Fraction

 

return b

 

u = [0, 1]

v = [[1], [1, 1]]

for i in range(1, n):

v.append(nextv(v[-1]))

for k, s in enumerate(v[j + 1]):

t[k] += r * s

u = nextu(u)

 

def polstr(a):

return "0"

 

print(i, ":", polstr(p))

 

8 : 1/9 n^9 + 1/2 n^8 + 2/3 n^7 - 7/15 n^5 + 2/9 n^3 - 1/30 n

9 : 1/10 n^10 + 1/2 n^9 + 3/4 n^8 - 7/10 n^6 + 1/2 n^4 - 3/20 n^2</lang>

=={{header|Racket}}==