A195618 a(0) = 1; a(n) = A001208(n) + 1 for n > 0.

1, 4, 9, 16, 27, 36, 53, 70, 90, 113, 147, 173, 213, 260, 303, 355, 419, 477, 549, 634, 715, 806, 903, 1013, 1128, 1255, 1383, 1525, 1679, 1842, 2011, 2189, 2383, 2585, 2802, 3021, 3257, 3509, 3773, 4044, 4327, 4629, 4942, 5273, 5607, 5961, 6335, 6724, 7121

Offset: 0

Author

N. J. A. Sloane, Sep 23 2011

Keywords

• nonn
• more

Comments

Lunnon sometimes works with this sequence rather than A001208. A001208 is the main entry.

Links

• W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

Crossrefs

Cf. A001208.

Column n=3 of the array A196416.

Extensions

Definition amended by Georg Fischer, Jan 25 2020