login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109704 Number of partitions of n into parts each equal to 2 mod 7. 0
0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 3, 1, 3, 2, 3, 3, 3, 4, 3, 4, 4, 4, 6, 4, 7, 4, 8, 5, 8, 7, 8, 9, 8, 10, 9, 11, 12, 11, 15, 11, 17, 12, 18, 15, 19, 19, 19, 22, 20, 24, 24, 25, 29, 26, 34, 27, 37, 31, 39, 38, 40, 44, 42, 49, 47, 52, 55, 54, 64, 56, 71, 62, 76, 72, 79 (list; graph; refs; listen; history; internal format)
OFFSET

1,16

FORMULA

G.f.=1/product(1-x^(2+7j), j=0..infinity)-1. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 14 2006

EXAMPLE

a(18)=3 because we have 18=16+2=9+9=2+2+2+2+2+2+2+2+2.

MAPLE

g:=1/product(1-x^(2+7*j), j=0..20)-1: gser:=series(g, x=0, 87): seq(coeff(gser, x, n), n=1..84); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 14 2006

CROSSREFS

Sequence in context: A029236 A152188 A025820 * A073407 A178810 A049994

Adjacent sequences:  A109701 A109702 A109703 * A109705 A109706 A109707

KEYWORD

nonn

AUTHOR

Erich Friedman (efriedma(AT)stetson.edu), Aug 07 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:09 EST 2012. Contains 205694 sequences.