OFFSET
1,2
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..10000
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)
G.f.: (-1 + g.f. of A049988)/(1-x). (End)
PROG
(PARI) seq(n)={my(w=(sqrtint(8*n+1)-1)\2+1); Vec(x/(1-x)^2 + sum(k=2, n, x^k/(1 - if(k<=w, x^(k*(k-1)/2)))/(1-x^k) + O(x*x^n))/(1-x))} \\ Andrew Howroyd, Sep 28 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Petros Hadjicostas, Sep 28 2019
STATUS
approved