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

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

1,22

FORMULA

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

EXAMPLE

a(40)=4 since 40 = 35+5 = 29+11 = 23+17 = 5+5+5+5+5+5+5+5

MAPLE

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

CROSSREFS

Sequence in context: A126304 A049455 A133734 * A115412 A143841 A035440

Adjacent sequences:  A109699 A109700 A109701 * A109703 A109704 A109705

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 14 15:22 EST 2012. Contains 205624 sequences.