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.

A126259 Numbers that are divisible by the number of letters in their English name, excluding spaces and hyphens;.

This page as a plain text file.
%I A126259 #9 Apr 07 2023 10:51:50
%S A126259 4,6,12,30,33,36,40,45,50,54,56,60,70,81,88,90,100,108,132,154,184,
%T A126259 190,200,204,252,253,264,276,286,288,299,300,304,306,325,336,338,340,
%U A126259 360,378,418,420,462,475,480,504,510,520,575,576,580,600,651,667,682,702
%N A126259 Numbers that are divisible by the number of letters in their English name, excluding spaces and hyphens;.
%C A126259 This version uses the British English convention of including "and"; see A092320 for the American English version. - _Michael S. Branicky_, Apr 07 2023
%H A126259 Michael S. Branicky, <a href="/A126259/b126259.txt">Table of n, a(n) for n = 1..10000</a>
%e A126259 The word "sixty" has 5 letters and 60 is divisible by 5 (60/5=12), so 60 is included in the list.
%e A126259 "one hundred and eight" has 18 letters and 18*6 = 108, so 108 is a term.
%o A126259 (Python)
%o A126259 from num2words import num2words
%o A126259 def letts(n): return sum(1 for c in num2words(n) if c.isalpha())
%o A126259 def ok(n): return n and n%letts(n) == 0
%o A126259 print([k for k in range(1000) if ok(k)]) # _Michael S. Branicky_, Apr 07 2023
%Y A126259 Cf. A005589, A000027, A092320.
%K A126259 nonn,word
%O A126259 1,1
%A A126259 Jonathan R. Love (japanada11(AT)yahoo.ca), Mar 08 2007
%E A126259 Corrected and extended by _Sean A. Irvine_, Mar 15 2010