OFFSET
1,1
COMMENTS
It is conjectured that a(34)=0 since no factorial < 10000 contained just 34 threes.
The 500-term b-file contains 16 zeros, each relying on the same conjecture, i.e., that because there is no factorial < 10000! containing just n threes no factorial satisfies the condition. - Harvey P. Dale, Jan 02 2021
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..500
EXAMPLE
a(2)=15 since the 15th factorial, i.e., 15!=1307674368000, contains exactly two 3's.
MATHEMATICA
Do[k = 1; While[ Count[IntegerDigits[k! ], 3] != n, k++ ]; Print[k], {n, 1, 60}]
With[{fc=Range[400]!}, Table[Position[fc, _?(DigitCount[#, 10, 3]==n&), 1, 1]/.{}->0, {n, 60}]]//Flatten (* Harvey P. Dale, Jan 02 2021 *)
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Shyam Sunder Gupta, Jul 30 2002
EXTENSIONS
Edited and extended by Robert G. Wilson v, Jul 31 2002
STATUS
approved