Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114329
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A114329
%S A114329 1,0,1,2,0,1,6,6,0,1,36,24,12,0,1,240,180,60,20,0,1,1920,1440,540,120,
%T A114329 30,0,1,17640,13440,5040,1260,210,42,0,1,183120,141120,53760,13440,2520,
%U A114329 336,56,0,1
%N A114329 Triangle T(n,k) = number of partitions of n-set into lists (cf. A000262) 
               with k lists of size 1.
%F A114329 E.g.f.: exp(x/(1-x)+(y-1)*x). More generally, e.g.f. for number of partitions 
               of n-set into lists with k lists of size m is exp(x/(1-x)+(y-1)*x^m).
%e A114329 1; 0,1; 2,0,1; 6,6,0,1; 36,24,12,0,1; 240,180,60,20,0,1; ...
%Y A114329 Cf. A000262, A052845.
%Y A114329 Sequence in context: A085845 A138106 A131689 this_sequence A101371 A154974 
               A078341
%Y A114329 Adjacent sequences: A114326 A114327 A114328 this_sequence A114330 A114331 
               A114332
%K A114329 easy,more,nonn,tabl
%O A114329 0,4
%A A114329 Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research