Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109707
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109707 Number of partitions of n into parts each equal to 5 mod 7. +0
1
0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 2, 1, 1, 1, 0, 2, 1, 2, 1, 1, 2, 1, 3, 1, 3, 2, 2, 3, 1, 4, 2, 4, 3, 2, 5, 2, 6, 3, 5, 5, 3, 7, 3, 8, 5, 6, 8, 4, 10, 5, 10, 8, 8, 11, 6, 13, 8, 13, 12, 10, 15, 9, 18, 12, 17, 16, 14, 21, 13, 23, 17, 22, 23, 18, 28, 18, 31, 24, 28 (list; graph; listen)
OFFSET

1,24

FORMULA

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

EXAMPLE

a(36)=3 because we have 36=26+5+5=19+12+5=12+12+12.

MAPLE

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

CROSSREFS

Sequence in context: A117162 A146061 A135936 this_sequence A064272 A117479 A118404

Adjacent sequences: A109704 A109705 A109706 this_sequence A109708 A109709 A109710

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research