Search: id:A006153
Results 1-1 of 1 results found.

%I A006153 M3578
%S A006153 1,1,4,21,148,1305,13806,170401,2403640,38143377,672552730,13044463641,
%T A006153 276003553860,6326524990825,156171026562838,4130464801497105,116526877671782896,
%U A006153 3492868475952497313,110856698175372359346,3713836169709782989993
%N A006153 Expansion of 1/(1-x*exp(x)).
%C A006153 Without the first "1" = eigensequence of triangle A003566. [From Gary 
               W. Adamson (qntmpkt(AT)yahoo.com), Dec 29 2008]
%D A006153 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006153 Getu, S.; Shapiro, L. W.; Combinatorial view of the composition of functions. 
               Ars Combin. 10 (1980), 131-145.
%D A006153 R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see 
               Problem 5.32(d).
%H A006153 INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=110">
               Encyclopedia of Combinatorial Structures 110</a>
%F A006153 n! * Sum(k=0, n, (n-k)^k/k!).
%F A006153 For n>=1 a(n-1)=b(n) where b(1)=1 and b(n)=sum(i=1, n-1, i*binomial(n-1, 
               i)*b(i)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 13 2004
%p A006153 a := proc(n) local k; add(k^(n-k)*n!/(n-k)!,k=1..n); end; # for n >= 
               1
%Y A006153 Cf. A072597.
%Y A006153 A003566 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 29 2008]
%Y A006153 Sequence in context: A158577 A006879 A163861 this_sequence A025164 A060072 
               A157503
%Y A006153 Adjacent sequences: A006150 A006151 A006152 this_sequence A006154 A006155 
               A006156
%K A006153 nonn,easy,nice
%O A006153 0,3
%A A006153 Simon Plouffe, N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds