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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109701 Number of partitions of n into parts each equal to 1 mod 6. 0
1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 7, 7, 7, 7, 8, 10, 11, 12, 12, 12, 13, 15, 17, 18, 19, 19, 20, 23, 26, 28, 29, 30, 31, 34, 38, 41, 43, 44, 46, 50, 55, 60, 63, 65, 67, 72, 79, 85, 90, 93, 96, 102, 111, 120, 127, 132, 136, 143, 154, 166, 176, 183, 189, 198 (list; graph; refs; listen; history; internal format)
OFFSET

1,7

FORMULA

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

EXAMPLE

a(10)=2 since 10 = 7+1+1+1 = 1+1+1+1+1+1+1+1+1+1

MAPLE

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

CROSSREFS

Sequence in context: A086394 A029226 A093354 * A124751 A103374 A137722

Adjacent sequences:  A109698 A109699 A109700 * A109702 A109703 A109704

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 17 04:26 EST 2012. Contains 205978 sequences.