cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A137579 Frequency of occurrence of the least frequent digits of decimal representation of n!.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 2, 1, 2, 2, 0, 2, 3, 0, 3, 2, 2, 3, 1, 2, 3, 2, 2, 3, 3, 2, 3, 4, 1, 4, 4, 5, 3, 3, 4, 4, 3, 5, 3, 6, 6, 4, 5, 5, 3, 5, 5, 7, 7, 6, 6, 4, 5, 8, 1, 8, 8, 5, 8, 7, 2, 6, 10, 6, 7, 7, 7, 8, 7, 11, 6, 7, 7
Offset: 0

Views

Author

Reinhard Zumkeller, Jan 27 2008

Keywords

Comments

a(n)=Min{A027869(n),A079680(n),A079714(n),A079684(n),A079688(n),A079690(n),A079691(n),A079692(n),A079693(n),A079694(n)}.
a(n) = 0 iff A137580(n) < 10.

Crossrefs

Programs

  • Mathematica
    Table[Min[DigitCount[n!]],{n,0,110}] (* Harvey P. Dale, Aug 21 2012 *)