|
Search: id:A078669
|
|
|
| A078669 |
|
Number of times n appears among the decimal digits of (n!)^n. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,9
|
|
|
EXAMPLE
|
a(6)=1 because 6 appears one time in 6!^6 = 139314069504000000.
|
|
PROGRAM
|
(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: A096623 A152889 A151905 this_sequence A046783 A134832 A123163
Adjacent sequences: A078666 A078667 A078668 this_sequence A078670 A078671 A078672
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Dec 16 2002
|
|
|
Search completed in 0.002 seconds
|
