|
%I #20 Feb 25 2024 11:00:35
%S 0,1,2,3,4,5,6,7,8,9,10,11,14,22,33,34,35,38,41,43,44,45,48,53,54,55,
%T 58,66,67,69,76,77,79,83,84,85,88,96,97,99,101,102,103,104,105,106,
%U 107,108,109,111,112,113,115,118,121,122,123,124,125,126,127,128,129,131,132
%N English name for number and its reverse have the same number of letters.
%C Obviously includes all palindromes (A002113).
%H Michael S. Branicky, <a href="/A107322/b107322.txt">Table of n, a(n) for n = 0..10000</a>
%e 35 is in sequence because 35 ("thirty-five") and 53 ("fifty-three") each have 10 letters in English (dashes not counted).
%t Select[Range[0,132],Length[Select[Characters[IntegerName[#,"Words"]],LetterQ]]==Length[Select[Characters[IntegerName[FromDigits[Reverse[IntegerDigits[#]]],"Words"]],LetterQ]]&] (* _James C. McMahon_, Feb 12 2024 *)
%o (Python)
%o from num2words import num2words
%o def n2w(n):
%o map = {ord(c): None for c in "-, "}
%o return num2words(n).replace(" and", "").translate(map)
%o def ok(n): return len(n2w(n)) == len(n2w(int(str(n)[::-1])))
%o print([k for k in range(133) if ok(k)]) # _Michael S. Branicky_, Feb 12 2024
%Y Cf. A002113, A004086, A005589.
%K base,nonn,word
%O 0,3
%A _David W. Wilson_, May 21 2005
%E 10 inserted by _James C. McMahon_, Feb 12 2024
|
