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.

A334375 a(n) equals the n-th Moran number (A001101) divided by its sum of digits.

Original entry on oeis.org

2, 7, 3, 7, 5, 7, 7, 37, 19, 13, 19, 19, 17, 13, 19, 19, 13, 11, 67, 23, 19, 37, 19, 19, 29, 19, 19, 37, 37, 31, 19, 67, 37, 47, 37, 31, 37, 73, 43, 37, 59, 37, 31, 37, 67, 37, 43, 37, 79, 73, 61, 41, 43, 37, 89, 73, 67, 47, 37, 61, 53, 37, 337, 127, 113, 109
Offset: 1

Views

Author

Rémy Sigrist, Apr 25 2020

Keywords

Examples

			For n = 42:
- A001101(42) = 555,
- A007953(555) = 15,
- hence a(42) = 555/15 = 37.
		

Crossrefs

Programs

  • PARI
    for (n=1, 1090, if (n%(s=sumdigits(n))==0 && isprime(n/s), print1 (n/s", ")))

Formula

a(n) = A001101(n) / A007953(A001101(n)).