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.
%I A116910 #28 Jul 29 2025 08:37:27
%S A116910 1,2,3,4,5,6,8,10,12,20,21,24,30,40,44,45,48,50,54,60,64,80,84,85,88,
%T A116910 90,92,96,100,102,110,111,112,116,120,132,133,135,150,152,156,168,174,
%U A116910 175,180,182,189,200,201,204,210,220,222,225,230,240,245,246,248
%N A116910 Numbers k such that the number of letters in the Roman numeral for k divides k.
%H A116910 Nathaniel Johnston and Harvey P. Dale, <a href="/A116910/b116910.txt">Table of n, a(n) for n = 1..1000</a> (first 593 terms from Nathaniel Johnston)
%F A116910 {k such that A006968(k)|k}.
%e A116910 a(23) = 84 because there are 6 letters in LXXXIV and 6 divides 84.
%e A116910 a(44) = 189 because there are 7 letters in CLXXXIX and 7 divides 189.
%e A116910 a(56) = 248 because there are 8 letters in CCXLVIII and 8 divides 248.
%p A116910 for n from 1 to 500 do if(n mod length(convert(n,roman)) = 0)then printf("%d, ",n): fi: od: # _Nathaniel Johnston_, May 18 2011
%t A116910 Select[Range[250],Divisible[#,StringLength[IntegerString[#,"Roman"]]]&] (* _Harvey P. Dale_, Feb 13 2013 *)
%Y A116910 Cf. A006968.
%K A116910 base,easy,nonn,less
%O A116910 1,2
%A A116910 _Jonathan Vos Post_, Mar 17 2006
%E A116910 Corrected by _Nathaniel Johnston_, May 18 2011