Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114918
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114918 Number of partitions of {1,..,n} into parts of sizes that are multiples of 2 and 3. +0
2
1, 0, 1, 1, 4, 10, 41, 140, 659, 2885, 14956, 77990, 452409, 2678676, 17176251, 113458801, 795016044, 5760341506, 43802563937, 344138100628, 2817486388739, 23809341016525, 208552149482436, 1882541647472398, 17549345518850193 (list; graph; listen)
OFFSET

0,5

FORMULA

E.g.f.: exp(SUM{k>0 is a multiple of 2 or 3} (x^k/k!)).

CROSSREFS

Cf. A000110, A007690.

Sequence in context: A053792 A032121 A007173 this_sequence A122648 A058819 A052394

Adjacent sequences: A114915 A114916 A114917 this_sequence A114919 A114920 A114921

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jan 06 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research