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.

A362092 Write the English name of a(n); concatenate the ranks of its letters in the alphabet; divide the concatenation by a(n); the result is an integer.

Original entry on oeis.org

1, 5, 25, 45, 46, 54, 111, 195, 295, 355, 3325, 4245, 7225, 11933, 115075, 359789, 761028, 962043, 1013845, 2281588, 3940925, 14387257, 90130513, 265601357, 490538725, 904759878, 1140058418, 1259245865, 1490515166, 1619293314
Offset: 1

Views

Author

Eric Angelini, Apr 08 2023

Keywords

Examples

			a(1) = 1, O.N.E, 15.14.5 and 15145/1 = 15145 with remainder 0;
a(2) = 5, F.I.V.E, 6.9.22.5 and 69225/5 = 13845 with remainder 0; etc.
		

Crossrefs

Cf. A362065.

Programs

  • Python
    from num2words import num2words
    def rankcat(n):
        return int("".join(str(ord(c)-96) for c in num2words(n).replace(" and", "") if c.isalpha()))
    def ok(n):
        return n and rankcat(n)%n == 0
    print([k for k in range(1000) if ok(k)]) # Michael S. Branicky, Apr 08 2023

Extensions

a(14)-a(23) from Michael S. Branicky, Apr 08 2023
a(24)-a(30) from Tejas Sah, Oct 17 2024