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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109708 Number of partitions of n into parts each equal to 6 mod 7. 0
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 2, 1, 0, 0, 1, 1, 2, 2, 1, 0, 1, 1, 2, 3, 3, 1, 1, 1, 2, 3, 4, 3, 2, 1, 2, 3, 5, 5, 5, 2, 2, 3, 5, 6, 8, 5, 3, 3, 5, 7, 10, 9, 7, 4, 5, 7, 11, 12, 12, 8, 6, 7, 12, 14, 17, 15, 11, 8, 12, 15, 20, 21, 19, 13, 13, 16, 22, 26, 28, 23 (list; graph; refs; listen; history; internal format)
OFFSET

1,26

FORMULA

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

EXAMPLE

a(45)=3 because we have 45=27+6+6+6=20+13+6+6=13+13+13+6.

MAPLE

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

CROSSREFS

Sequence in context: A204770 A143379 A136567 * A035468 A051777 A107628

Adjacent sequences:  A109705 A109706 A109707 * A109709 A109710 A109711

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 16 12:41 EST 2012. Contains 205909 sequences.