login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A079113
Number of 3's in n# (n primorial) = 3's in A002110(n).
1
0, 0, 1, 0, 1, 2, 0, 0, 1, 2, 1, 2, 2, 4, 0, 2, 2, 3, 1, 2, 2, 3, 1, 5, 5, 8, 4, 3, 3, 3, 7, 2, 6, 9, 8, 9, 4, 9, 6, 5, 4, 6, 7, 6, 11, 8, 7, 16, 11, 6, 8, 12, 8, 12, 8, 12, 4, 16, 11, 4, 15, 14, 15, 11, 15, 14, 8, 13, 20, 10, 8, 18, 14, 15, 14, 16, 14, 16, 12, 22, 17, 17, 15, 17, 17, 20, 14, 16
OFFSET
2,6
LINKS
MATHEMATICA
DigitCount[#, 10, 3]&/@Rest[FoldList[Times, 1, Prime[Range[100]]]] (* Vincenzo Librandi, Apr 07 2014 *)
PROG
(PARI) See program in Number of 0's in n#
CROSSREFS
Cf. A002110.
Sequence in context: A204425 A245187 A292598 * A144874 A333365 A303065
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Feb 03 2003
STATUS
approved