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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109697 Number of partitions of n into parts each equal to 1 mod 5. 1
1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 7, 7, 7, 8, 10, 11, 12, 12, 13, 15, 17, 18, 19, 20, 23, 26, 28, 29, 31, 34, 38, 41, 43, 45, 50, 55, 60, 63, 66, 71, 79, 85, 90, 94, 101, 110, 120, 127, 133, 141, 153, 165, 176, 184, 195, 210, 227, 241, 254, 267, 286, 307, 327 (list; graph; refs; listen; history; internal format)
OFFSET

0,7

FORMULA

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

EXAMPLE

a(11)=3 since 11 = 11 = 6+1+1+1+1+1 = 1+1+1+1+1+1+1+1+1+1+1

MAPLE

g:=1/product(1-x^(1+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

MATHEMATICA

Table[Count[IntegerPartitions[n], _?(Union[Mod[#, 5]]=={1}&)], {n, 0, 75}] (* From Harvey P. Dale, Oct 08 2011 *)

CROSSREFS

Cf. A000041, A003105.

Sequence in context: A025783 A025780 A199121 * A103373 A038539 A109368

Adjacent sequences:  A109694 A109695 A109696 * A109698 A109699 A109700

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 14 23:53 EST 2012. Contains 205689 sequences.