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.

A363743 a(n) = floor(sqrt(log_10(n!))).

Original entry on oeis.org

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

Views

Author

Paul F. Marrero Romero, Aug 17 2023

Keywords

Comments

Every nonnegative integer occurs at least 4 times.
Each integer k > 14 appears fewer than k times.
The only integers k that occur exactly k times are 11, 13 and 14.

Crossrefs

Programs

  • Mathematica
    Array[Floor@ Sqrt[Log10[#!]] &, 93, 0]
  • PARI
    a(n) = sqrtint(log(n!)/log(10)); \\ Michel Marcus, Sep 27 2023

Formula

a(n) = floor(sqrt(A034886(n) - 1)).
a(n) = A000196(A034886(n) - 1).