The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A078669 Number of times n appears among the decimal digits of (n!)^n. 0
 1, 0, 0, 0, 0, 1, 0, 1, 4, 0, 0, 1, 2, 2, 2, 1, 2, 4, 3, 1, 5, 3, 2, 11, 5, 1, 2, 7, 8, 15, 8, 5, 11, 11, 10, 8, 7, 10, 16, 17, 15, 19, 12, 17, 18, 23, 27, 19, 24, 30, 18, 25, 40, 30, 23, 27, 29, 31, 33, 48, 48, 50, 30, 49, 51, 51, 58, 55, 67, 52, 59, 50, 52, 63, 78, 67, 92, 107, 94, 74 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 LINKS EXAMPLE a(6)=1 because 6 appears one time in 6!^6 = 139314069504000000. PROG (PARI) \ Type ff to run. {mdcp(d, n)=local(a, c=0, L); L=length(Str(d)); if(L>1, a=2, a=1); while(n>0, if(n%(10^a)==d, n=floor(n/10); c++, n=floor(n/10); )); c } {ff()=local(a); print("Enter an ending value <= 99: "); a=input(); if(a>99, error("Input not valid, try again."), for(n=1, a, print1(mdcp(n, (n!)^n)", ")); ) } CROSSREFS Cf. A036740. Sequence in context: A151905 A226997 A245965 * A229655 A335951 A254156 Adjacent sequences:  A078666 A078667 A078668 * A078670 A078671 A078672 KEYWORD base,nonn AUTHOR Jason Earls, Dec 16 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 22:29 EDT 2020. Contains 337273 sequences. (Running on oeis4.)