A078669 Number of times n appears among the decimal digits of (n!)^n.

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

Offset

1,9

Links

Table of n, a(n) for n=1..80.

Example

a(6)=1 because 6 appears one time in 6!^6 = 139314069504000000.

Prog

(PARI) {mcf(d, n)=my(c=0, m=10^#digits(d)); while(n>0, if(n%m==d, c++); n\=10; ); c }
a(n) = {mcf(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