Return to Revisions

2 of 3

added 216 characters in body

edited Jun 24, 2017 at 15:59

edited Jun 24, 2017 at 15:59

Oasis, 4 bytes

###Code:

nj+U

###Explanation:

Extended version:

nj+00
 0 = a(0)
 0 = a(1)
a(n) =
n # Push n
 j # Get the largest divisor under n
 + # Add to a(n - 1)

answered Jun 24, 2017 at 11:47