A049991 a(n) is the number of arithmetic progressions of 2 or more positive integers, nondecreasing with sum <= n.

0, 1, 3, 6, 9, 15, 19, 25, 33, 41, 47, 60, 67, 77, 92, 104, 113, 132, 142, 158, 178, 193, 205, 231, 247, 264, 289, 310, 325, 359, 375, 397, 427, 449, 473, 513, 532, 556, 591, 623, 644, 689, 711, 741, 788, 817, 841, 892, 920, 957, 1003, 1038, 1065, 1121, 1157, 1197, 1248, 1284, 1314, 1384, 1415

Offset

1,3

Links

Table of n, a(n) for n=1..61.

Sadek Bouroubi and Nesrine Benyahia Tani, Integer partitions into arithmetic progressions, Rostok. Math. Kolloq. 64 (2009), 11-16.

Sadek Bouroubi and Nesrine Benyahia Tani, Integer partitions into arithmetic progressions with an odd common difference, Integers 9(1) (2009), 77-81.

Graeme McRae, Counting arithmetic sequences whose sum is n.

Graeme McRae, Counting arithmetic sequences whose sum is n [Cached copy]

Augustine O. Munagi, Combinatorics of integer partitions in arithmetic progression, Integers 10(1) (2010), 73-82.

Augustine O. Munagi and Temba Shonhiwa, On the partitions of a number into arithmetic progressions, Journal of Integer Sequences 11 (2008), Article 08.5.4.

A. N. Pacheco Pulido, Extensiones lineales de un poset y composiciones de números multipartitos, Maestría thesis, Universidad Nacional de Colombia, 2012.

Wikipedia, Arithmetic progression.

Formula

From Petros Hadjicostas, Sep 29 2019: (Start)

a(n) = Sum_{k = 1..n} A049990(k).

G.f.: (g.f. of A049990)/(1-x). (End)

Crossrefs

Cf. A014405, A014406, A049980, A049981, A049982, A049983, A049987, A049988, A049989, A049990, A049991, A111333, A127938.

Sequence in context: A000741 A133205 A355498 * A368611 A143981 A031940

Adjacent sequences: A049988 A049989 A049990 * A049992 A049993 A049994

Keyword

nonn

Author

Clark Kimberling

Extensions

More terms from Petros Hadjicostas, Sep 29 2019

Status

approved