Daily Challenge (245 Part Series)
In the drawing below we have a part of the Pascal's triangle, lines are numbered from zero (top).
We want to calculate the sum of the squares of the binomial coefficients on a given line with a function called easyline (or easyLine or easy-line).
Can you write a program which calculates easyline(n) where n is the line number?
The function will take n (with: n >= 0) as parameter and will return the sum of the squares of the binomial coefficients on line n.
easyline(0) => 1
easyline(1) => 2
easyline(4) => 70
easyline(50) => 100891344545564193334812497256
Want to propose a challenge idea for a future post? Email email@example.com with your suggestions!
Claim your page on DEV before someone else does
Level up every day