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.

This page as a plain text file.
%I A362092 #24 Oct 17 2024 09:59:41
%S A362092 1,5,25,45,46,54,111,195,295,355,3325,4245,7225,11933,115075,359789,
%T A362092 761028,962043,1013845,2281588,3940925,14387257,90130513,265601357,
%U A362092 490538725,904759878,1140058418,1259245865,1490515166,1619293314
%N 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.
%e A362092 a(1) = 1, O.N.E, 15.14.5 and 15145/1 = 15145 with remainder 0;
%e A362092 a(2) = 5, F.I.V.E, 6.9.22.5 and 69225/5 = 13845 with remainder 0; etc.
%o A362092 (Python)
%o A362092 from num2words import num2words
%o A362092 def rankcat(n):
%o A362092     return int("".join(str(ord(c)-96) for c in num2words(n).replace(" and", "") if c.isalpha()))
%o A362092 def ok(n):
%o A362092     return n and rankcat(n)%n == 0
%o A362092 print([k for k in range(1000) if ok(k)]) # _Michael S. Branicky_, Apr 08 2023
%Y A362092 Cf. A362065.
%K A362092 nonn,base,word,more
%O A362092 1,2
%A A362092 _Eric Angelini_, Apr 08 2023
%E A362092 a(14)-a(23) from _Michael S. Branicky_, Apr 08 2023
%E A362092 a(24)-a(30) from _Tejas Sah_, Oct 17 2024