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.

A368195 a(n) is the number of numbers that can be obtained by replacing any positive number without leading zeros, say m, appearing in the decimal expansion of n by one of the divisors of m.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 7, 3, 6, 5, 8, 3, 9, 4, 6, 5, 6, 4, 11, 5, 8, 6, 10, 5, 8, 3, 8, 6, 7, 6, 13, 4, 8, 7, 8, 4, 11, 5, 10, 8, 9, 5, 15, 7, 6, 5, 8, 4, 11, 6, 12, 6, 8, 5, 12, 5, 8, 10, 12, 8, 14, 6, 12, 9, 8, 3, 13, 4, 7, 7, 10, 6, 12, 5, 10, 8
Offset: 1

Views

Author

Rémy Sigrist, Dec 16 2023

Keywords

Comments

a(n) gives the number of terms in the n-th row of A368194.

Examples

			For n = 42: the 42nd row of A368194 contains 11 terms (1, 2, 3, 6, 7, 12, 14, 21, 22, 41, 42), so a(42) = 11.
		

Crossrefs

Cf. A000005, A368194, A368314 (binary variant).

Programs

  • PARI
    See Links section.

Formula

a(n) >= A000005(n).