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

%I A006902 M4003
%S A006902 1,5,47,641,11389,248749,6439075,192621953,6536413529,248040482741,10407123510871,
%T A006902 478360626529345,23903857657114837,1290205338991689821,74803882225482661259
%N A006902 (2n)! Sum (-1)^k binomial(n,k) / (n+k)!.
%D A006902 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006902 J. D. Horton and A. Kurn, Counting sequences with complete increasing 
               subsequences, Congress. Numerantium, 33 (1981), 75-80.
%F A006902 n!*LaguerreL(n, n, 1). - Vladeta Jovovic (vladeta(AT)eunet.rs), May 11 
               2003
%F A006902 (n-2)*a(n)-(n^3+n^2-7*n+4)*a(n-1)+2*(2*n-3)*(n-1)^3*a(n-2) = 0. - Vladeta 
               Jovovic (vladeta(AT)eunet.rs), Jul 16 2004
%Y A006902 Cf. A047909.
%Y A006902 Cf. A082545.
%Y A006902 Sequence in context: A136023 A074192 A058806 this_sequence A127696 A088691 
               A052802
%Y A006902 Adjacent sequences: A006899 A006900 A006901 this_sequence A006903 A006904 
               A006905
%K A006902 nonn,easy
%O A006902 1,2
%A A006902 Simon Plouffe, N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.002 seconds