Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138771
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A138771
%S A138771 1,1,1,2,3,1,6,11,5,2,24,50,26,14,6,120,274,154,94,54,24,720,1764,1044,
%T A138771 684,444,264,120,5040,13068,8028,5508,3828,2568,1560,720,40320,109584,
%U A138771 69264,49104,35664,25584,17520,10800,5040
%N A138771 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,
               n} whose 2nd cycle has k entries; each cycle is written with the 
               smallest element first and cycles are arranged in increasing order 
               of their first elements (n>=1; 0<=k<=n-1). For example, 1432=(1)(24)(3) 
               has 2 entries in the 2nd cycle; 3421=(1324) has 0 entries in the 
               2nd cycle.
%C A138771 T(n,0)=(n-1)!=A000142(n-1).
%C A138771 T(n,1)=A000254(n-1).
%C A138771 T(n,2)=A001705(n-2).
%C A138771 T(n,3)=2*A001711(n-4).
%C A138771 T(n,4)=6*A001716(n-5).
%C A138771 T(n,n-1)=(n-2)! (n>=2).
%C A138771 Sum(kT(n,k),k=0..n-1)=(n-1)!(n-1)(n+2)/4=A138772(n).
%F A138771 T(n,k)=(n-1)T(n-1,k)+(n-2)! (1<=k<=n-1). The row generating polynomials 
               P[n](t) satisfy: P[n+1](t)=nP[n](t)+(n-1)!(t+t^2+...+t^n)
%e A138771 T(4,2)=5 because we have (1)(23)(4), (1)(24)(3), (13)(24), (12)(34) and 
               (14)(23).
%e A138771 Triangle starts;
%e A138771 1;
%e A138771 1,1;
%e A138771 2,3,1;
%e A138771 6,11,5,2;
%e A138771 24,50,26,14,6;
%e A138771 120,274,154,94,54,24;
%p A138771 T:=proc (n,k) if k = 0 then factorial(n-1) elif n <= k then 0 else (n-1)*T(n-1, 
               k)+factorial(n-2) end if end proc: for n to 9 do seq(T(n, k), k=0..n-1) 
               end do;
%Y A138771 Cf. A000142, A000254, A001705, A001711, A001716, A138772.
%Y A138771 Contribution from Johannes W. Meijer (meijgia(AT)hotmail.com), Oct 16 
               2009: (Start)
%Y A138771 A000142 equals for n=>1 the row sums.
%Y A138771 A138771(n) = A165680(n) * A165675(n-1)
%Y A138771 (End)
%Y A138771 Sequence in context: A155856 A086960 A165675 this_sequence A121748 A008275 
               A130534
%Y A138771 Adjacent sequences: A138768 A138769 A138770 this_sequence A138772 A138773 
               A138774
%K A138771 nonn,tabl
%O A138771 1,4
%A A138771 Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 10 2008

    
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 December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research