The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A109703 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A109703

Number of partitions of n into parts each equal to 1 mod 7.
(history; published version)

#24 by Sean A. Irvine at Wed Jul 17 17:13:46 EDT 2019

STATUS

reviewed

approved

#23 by Vaclav Kotesovec at Wed Jul 17 16:57:19 EDT 2019

STATUS

proposed

reviewed

#22 by Ilya Gutkovskiy at Wed Jul 17 14:53:32 EDT 2019

STATUS

editing

proposed

#21 by Ilya Gutkovskiy at Wed Jul 17 14:34:44 EDT 2019

FORMULA

G.f.: Sum_{k>=0} x^k / Product_{j=1..k} (1 - x^(7*j)). - Ilya Gutkovskiy, Jul 17 2019

STATUS

approved

editing

#20 by Bruno Berselli at Mon Mar 20 12:18:00 EDT 2017

STATUS

reviewed

approved

#19 by Joerg Arndt at Mon Mar 20 11:27:13 EDT 2017

STATUS

proposed

reviewed

#18 by Seiichi Manyama at Mon Mar 20 10:47:09 EDT 2017

STATUS

editing

proposed

#17 by Seiichi Manyama at Mon Mar 20 10:41:48 EDT 2017

FORMULA

a(n) = (1/n)*Sum_{k=1..n} A284099(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 20 2017

CROSSREFS

Cf. A284099.

#16 by Seiichi Manyama at Mon Mar 20 10:38:49 EDT 2017

CROSSREFS

Cf. similar sequences of number of partitions of n into parts congruent to 1 mod m: A000009 (m=2), A035382 (m=3), A035451 (m=4), A109697 (m=5), A109701 (m=6), this sequence (m=7), A277090 (m=8).

STATUS

approved

editing

#15 by Vaclav Kotesovec at Tue Jan 24 16:17:34 EST 2017

STATUS

editing

approved