Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126804
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A126804
%S A126804 2,24,360,6720,151200,3991680,121080960,4151347200,158789030400,
%T A126804 6704425728000,309744468633600,15543540607795200,841941782922240000,
%U A126804 48962152914554880000,3042648073975910400000,201220459292273541120000
%N A126804 Multiplying n X n integers above n.
%C A126804 a(n)=2*A001814(n) - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 
               03 2007
%F A126804 a(n) = (2n)! / (n-1)!
%e A126804 a(5)= 151200 because five digits above 5: (6, 7, 8, 9, 10), multiplied 
               by five equals 5*(6*7*8*9*10)= 151200
%p A126804 a:=n->sum((count(Permutation(2*n+2),size=n+1)),j=0..n): seq(a(n), n=0..15); 
               - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 03 2007
%p A126804 seq(mul((n+k), k=0..n), n=1..16); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Sep 21 2007
%p A126804 with(combstruct):with(combinat) :bin := {B=Union(Z,Prod(B,B))}: seq (count([B,
               bin,labeled],size=n)*(n-1), n=2..17); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Dec 05 2007
%Y A126804 Sequence in context: A043699 A134805 A119702 this_sequence A090114 A081685 
               A052670
%Y A126804 Adjacent sequences: A126801 A126802 A126803 this_sequence A126805 A126806 
               A126807
%K A126804 nonn
%O A126804 1,1
%A A126804 Jonathan R. Love (japanada11(AT)yahoo.ca), Feb 22 2007

    
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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research