Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131451
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A131451
%S A131451 1,2,6,24,120,720,5040,40320,362880,362880,362880,725760,2177280,
%T A131451 8709120,43545600,261273600,1828915200,14631321600,131681894400,
%U A131451 263363788800,526727577600,2106910310400,12641461862400,101131694899200
%N A131451 Product of the non-zero digital products of all the numbers 1 to n (a 
               'total digital-product factorial' in base 10).
%H A131451 Hieronymus Fischer, <a href="b131451.txt">Table of n, a(n) for n = 1..102</
               a>
%F A131451 The following formulas are given for general bases p>1:
%F A131451 a(n)=product{1<=k<=n, dp_p(k)} where dp_p(k) = product of the non-zero 
               digits of k in base p.
%F A131451 a(n)=(n mod p)!*product{0<j<=log_p(n)}(p-1)!^(floor(n/p^j)*p^(j-1)) * 
               product{0<j<=log_p(n),(floor(n/p^j)mod p)>0}(floor(n/p^j)mod p)^(1+(n 
               mod p^j))*((floor(n/p^j)mod p)-1)!^(p^j).
%F A131451 Recurrence: a(n+k*p^m)=a(n)*k^n*a(k*p^m) for 0<=k<p, 0<=n<p^m.
%F A131451 a(n)=n!, for 0<=n<p.
%F A131451 a(k*p^m)=k*(p-1)!^(k*m*p^(m-1))*(k-1)!^(p^m) for 0<=k<p.
%F A131451 a(n)=(p-1)!^((m*p^(m+1)-(m+1)*p^m+1)/(p-1)^2)=(p-1)!^(1+2*p+3*p^2+...= 
               +m*p^(m-1)) for n=1+p+p^2+...+p^m.
%F A131451 a(n)=(p-1)!^(k*(m*p^(m+1)-(m+1)*p^m+1)/(p-1)^2)*(k-1)!^(p*(p^m-1)/(p-1)= 
               )*k^(k*(p^(m+1)-(m+1)*p+m)/(p-1)^2)*k!*k^m, for n=k*(1+p+p^2+...+p^m).
%F A131451 For p=10: a(10^n)=9!^(n*10^(n-1)).
%F A131451 Asymptotic behavior: a(10^n)=10^(0.5559763...*n*10^n). Hence it grows 
               slower than the factorial A000142(10^n) for which we have (10^n)!=10^((n-0.43429448...)*10^n+n/
               2+0.3990899...+o(1/n)). Example: a(1000) has 1668 digits, whereas 
               1000! has 2568 digits.
%e A131451 a(12)=dp_10(1)*dp_10(2)*dp_10(3)*...*dp_10(11)*dp_10(12)=1*2*3*4*5*6* 
               7*8*9*1*(1*1)*(1*2).
%e A131451 a(345)=3*4*5*3^45*4^5*(3-1)!^100*(4-1)!^10*(5-1)!^1*9!^64.
%e A131451 a(1000)=9!^300. a(1111)=9!^321.
%Y A131451 Cf. A131385, A010786, A131387, A007953, A007954, A037131.
%Y A131451 Sequence in context: A061602 A033647 A109834 this_sequence A084012 A062919 
               A154657
%Y A131451 Adjacent sequences: A131448 A131449 A131450 this_sequence A131452 A131453 
               A131454
%K A131451 nonn
%O A131451 1,2
%A A131451 Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jul 11 2007
%E A131451 New b-file from Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 
               10 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research