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.

A111653 n-th composite number appears n times.

Original entry on oeis.org

4, 6, 6, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 12, 12, 12, 12, 12, 12, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21
Offset: 1

Views

Author

Jonathan Vos Post, Aug 12 2005

Keywords

Comments

A002808(n) appears n times.

Crossrefs

Programs

  • Python
    from math import isqrt
    from sympy import composite
    def A111653(n): return composite(isqrt(n<<3)+1>>1) # Chai Wah Wu, Sep 06 2025