Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,22

FORMULA

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

EXAMPLE

a(22)=2 because we have 22=18+4=11+11.

MAPLE

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

CROSSREFS

Sequence in context: A034380 A077479 A070106 this_sequence A029444 A122191 A097847

Adjacent sequences: A109703 A109704 A109705 this_sequence A109707 A109708 A109709

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research