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.

A350786 a(n) is the number of divisors of A061799(n).

Original entry on oeis.org

1, 2, 3, 4, 6, 6, 8, 8, 9, 10, 12, 12, 16, 16, 16, 16, 18, 18, 20, 20, 24, 24, 24, 24, 30, 30, 30, 30, 30, 30, 32, 32, 36, 36, 36, 36, 40, 40, 40, 40, 48, 48, 48, 48, 48, 48, 48, 48, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 64, 64, 64, 64, 72, 72, 72, 72, 72, 72, 72, 72
Offset: 1

Views

Author

J. Lowell, Jul 07 2022

Keywords

Comments

a(n) is the smallest term of A002183 that is >= n.

Examples

			a(5) = 6 because A061799(5) = 12 has 6 divisors.
		

Crossrefs

Programs

  • PARI
    for(n=1, 100, my(s=n); while(numdiv(s)Michel Marcus, Jul 07 2022

Formula

a(n) = A000005(A061799(n)).