Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A115275
%S A115275 1,1,2,5,14,51,187,820,3670,18191,97917,554500,3334465,20871592,
%T A115275 138440031,972083845,6985171390,52194795327,412903730293,3313067916192,
%U A115275 28017395030419,241504438776956,2189375704925081,19771679215526507
%N A115275 Number of partitions of {1,...,n} into blocks such that no block size 
               is repeated more than 3 times.
%F A115275 E.g.f.: Product {m >= 1} (1+x^m/m!+(x^m/m!)^2+(x^m/m!)^3)
%Y A115275 Cf. A001935, A007837, A115276, A115277.
%Y A115275 Sequence in context: A115340 A000109 A049338 this_sequence A000679 A081439 
               A052649
%Y A115275 Adjacent sequences: A115272 A115273 A115274 this_sequence A115276 A115277 
               A115278
%K A115275 nonn
%O A115275 0,3
%A A115275 Christian G. Bower (bowerc(AT)usa.net), Jan 18 2006

    
page 1

Search completed in 0.001 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