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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109703 Number of partitions of n into parts each equal to 1 mod 7. 0
1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 5, 6, 7, 7, 7, 7, 7, 8, 10, 11, 12, 12, 12, 12, 13, 15, 17, 18, 19, 19, 19, 20, 23, 26, 28, 29, 30, 30, 31, 34, 38, 41, 43, 44, 45, 46, 50, 55, 60, 63, 65, 66, 68, 72, 79, 85, 90, 93, 95, 97, 103, 111, 120, 127, 132, 135 (list; graph; refs; listen; history; internal format)
OFFSET

1,8

FORMULA

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

EXAMPLE

a(15)=3 because we have 15=8+1+1+1+1+1+1+1=1+1+1+1+1+1+1+1+1+1+1+1+1+1+1.

MAPLE

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

CROSSREFS

Sequence in context: A025845 A029393 A173021 * A103375 A046663 A064132

Adjacent sequences:  A109700 A109701 A109702 * A109704 A109705 A109706

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 06:18 EST 2012. Contains 205860 sequences.