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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109699 Number of partitions of n into parts each equal to 3 mod 5. 0
1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 3, 2, 2, 4, 2, 4, 4, 3, 5, 4, 5, 6, 5, 7, 6, 8, 8, 7, 11, 9, 10, 13, 10, 14, 14, 14, 17, 16, 19, 19, 20, 24, 21, 27, 27, 27, 33, 30, 35, 38, 36, 44, 42, 47, 51, 50, 58, 57, 63, 68, 66, 79, 76, 82, 92, 88, 101, 104, 107, 120 (list; graph; refs; listen; history; internal format)
OFFSET

0,17

FORMULA

G.f.=1/product(1-x^(3+5j), j=0..infinity). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006

EXAMPLE

a(21)=3 since 21 = 18+3 = 13+8 = 3+3+3+3+3+3+3

MAPLE

g:=1/product(1-x^(3+5*j), j=0..25): gser:=series(g, x=0, 85): seq(coeff(gser, x, n), n=0..80); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006

CROSSREFS

Sequence in context: A000119 A097368 A194083 * A029283 A116482 A173306

Adjacent sequences:  A109696 A109697 A109698 * A109700 A109701 A109702

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006

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 10:06 EST 2012. Contains 205763 sequences.