login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114918 Number of partitions of {1,..,n} into parts of sizes that are multiples of 2 and 3. 1

%I #2 Mar 30 2012 17:37:16

%S 1,0,1,1,4,10,41,140,659,2885,14956,77990,452409,2678676,17176251,

%T 113458801,795016044,5760341506,43802563937,344138100628,

%U 2817486388739,23809341016525,208552149482436,1882541647472398,17549345518850193

%N Number of partitions of {1,..,n} into parts of sizes that are multiples of 2 and 3.

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

%Y Cf. A000110, A007690.

%K nonn

%O 0,5

%A _Christian G. Bower_, Jan 06 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:15 EDT 2024. Contains 371265 sequences. (Running on oeis4.)