|
Search: id:A091091
|
|
|
| A091091 |
|
Numbers needing in binary and ternary representation an equal minimal number of editing steps (delete, insert or substitute) to transform them into their square. |
|
+0
3
|
|
| 0, 1, 5, 6, 8, 11, 13, 16, 17, 18, 19, 33, 35, 38, 40, 56, 60, 74, 122, 123, 133, 143, 146, 164, 168, 173, 299, 350, 365, 429, 497, 515, 527, 564, 566, 593, 608, 611, 710, 1031, 1050, 1052, 1059, 1088, 1089, 1090, 1092, 1096, 1105, 1287, 1301, 1316, 1322
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
A091092(a(n)) = A091093(a(n)).
|
|
LINKS
|
Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane (njas(AT)research.att.com)]
Eric Weisstein's World of Mathematics, Square Number
Eric Weisstein's World of Mathematics, Binary
Eric Weisstein's World of Mathematics, Ternary
|
|
CROSSREFS
|
Cf. A007088, A001737, A007089, A001738, A000290.
Sequence in context: A074819 A113935 A088766 this_sequence A120151 A022937 A030742
Adjacent sequences: A091088 A091089 A091090 this_sequence A091092 A091093 A091094
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 18 2003
|
|
|
Search completed in 0.002 seconds
|
