A072763 Duplicate of A057846.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 41, 51, 16, 17, 81, 91, 20, 12, 22, 32, 42, 52, 62, 72, 82, 92, 30, 13, 32
Offset: 1
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.
(n,o=[9, 8, 1, 7, 4, 0, 6, 5, 2, 3])->{ sum(i=1,#n=vecsort(digits(n),(a,b)->o[b+1]-o[a+1]),n[i]*10^i)/10}
a(1) = 3 because EERHT comes alphabetically first. a(2) = 9 because ENIN comes alphabetically second. a(3) = 1 because ENO comes alphabetically third. a(4) = 5 because EVIF comes alphabetically fourth.
Eerht, Enin, Eno, Evif, Neves, Orez, Owt, Ruof, Thgie, Xis; Eerhtytenin, Eerhtytfif, Eerhtythgie, Eerhtytneves, Eerhtytnewt, Eerhtytriht, Eerhtytrof, Eerhtytxis, Eninytenin, Eninytfif, Eninythgie, Eninytneves, Eninytnewt, Eninytriht, Eninytrof, Eninytxis, Enoytenin, Enoytfif, Enoythgie, Enoytneves, Enoytnewt, Enoytriht, Enoytrof, Enoytxis, Evifytenin, Evifytfif, ...
f[a_, b_] := Sort@ Table[{ StringReverse[ StringReplace[ IntegerName[h, "Words"], {"\[Hyphen]" -> ""}]], h}, {h, a, b}]; Last /@ Join[f[0, 9], f[10, 99]] (* Giovanni Resta, Jun 13 2016 *)
Comments