cp's OEIS Frontend

A091092 In binary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.

%I A091092 #16 Feb 16 2025 08:32:52
%S A091092 0,0,1,2,2,2,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,5,6,5,5,5,5,5,5,5,5,5,5,
%T A091092 5,5,5,5,5,6,5,5,5,6,6,6,7,7,6,6,6,6,6,6,6,7,6,6,6,6,6,6,6,6,6,6,6,6,
%U A091092 6,6,6,6,6,6,6,7,6,6,7,7,6,6,6,6,6,7,7,7,7,6,7,8,8,7,8,8,7,7,7,7,7,8
%N A091092 In binary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.
%C A091092 a(n) = A152487(A000290(n),n). - _Reinhard Zumkeller_, Dec 06 2008
%H A091092 Alois P. Heinz, <a href="/A091092/b091092.txt">Table of n, a(n) for n = 0..20000</a>
%H A091092 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SquareNumber.html">Square Number</a>
%H A091092 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Binary.html">Binary</a>
%H A091092 Wikipedia, <a href="https://en.wikipedia.org/wiki/Levenshtein_distance">Levenshtein Distance</a>
%H A091092 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A091092 a(n) = LevenshteinDistance(A007088(n), A001737(n)).
%e A091092 a(7)=3: 7->'111', 3 x insert a 0 between the last two 1's:
%e A091092 '110001'->49=7^2.
%Y A091092 Cf. A091093, A091091, A070939, A000290.
%K A091092 nonn,base
%O A091092 0,4
%A A091092 _Reinhard Zumkeller_, Dec 18 2003