| about | help | code help+videos | done | prefs |
pyramidal
The triangular numbers are 1,3,6,10,15,21,... where the nth number is n more than the preceding number. Given a positive integer n, compute the sum of the first n triangular numbers. (These are called pyramidal numbers.) pyramidal(2) → 4 pyramidal(3) → 10 pyramidal(4) → 20 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 220
Copyright Nick Parlante 2017 - privacy