|
%I #5 Mar 13 2015 18:26:44
%S 3,15,23,26,32,41,35,45,50,72,63,83,84,98,89,94,91,121,99,142,117,160,
%T 129,0,127,131,132,154,153,163,170,179,190,178,166,189,217,209,206,
%U 174,208,199,207,211,214,245,263,175,240,255,295,234,213,296,286,266,278
%N a(n)-th factorial is the smallest factorial containing exactly n 6's, or 0 if no such number exists.
%C It is conjectured that a(24)=0 since no factorial < 10000 contained just 24 sixes.
%e a(2)=15 since the 15th factorial, i.e., 15!=1307674368000, contains exactly two 6's.
%t Do[k = 1; While[ Count[IntegerDigits[k! ], 6] != n, k++ ]; Print[k], {n, 1, 60}]
%Y Cf. A072240, A072220, A072208, A072204, A072199, A072178, A072177, A072163 & A072124.
%K base,nonn
%O 1,1
%A _Shyam Sunder Gupta_, Jul 30 2002
%E Edited and extended by _Robert G. Wilson v_, Jul 31 2002
|
