A118026 a(0) = 0, a(n) = a(n-1) + (largest integer which is <= n and is missing from the earlier terms of the sequence).

0, 1, 3, 5, 9, 13, 19, 26, 34, 42, 52, 63, 75, 87, 101, 116, 132, 149, 167, 185, 205, 226, 248, 271, 295, 320, 345, 372, 400, 429, 459, 490, 522, 555, 588, 623, 659, 696, 734, 773, 813, 854, 895, 938, 982, 1027, 1073, 1120, 1168, 1217, 1267, 1318, 1369, 1422

Offset: 0

Author

Leroy Quet, Apr 10 2006

Keywords

• easy
• nonn

Links

• Michael De Vlieger, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A118027, A118028, A118029, A118030, A094589.

Programs

Mathematica

a = {1}; Do[AppendTo[a, a[[i - 1]] + SelectFirst[Reverse@ Range[i], FreeQ[a, #] &]], {i, 2, 53}]; {0}~Join~a (* Michael De Vlieger, Sep 16 2017 *)

Extensions

More terms from Sheedeh Dorri (spd145(AT)psu.edu) and Melissa Donovan (msd181(AT)psu.edu), Apr 18 2006