A171400 - OEIS

A171400

Minimal number of editing steps (delete, insert or substitute) to transform the binary representation of n into that of A007918(n), the least prime not less than n.

1, 1, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 0, 3, 3, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 2, 2, 1, 0, 1, 0, 2, 1, 2, 2, 1, 0, 3, 3, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 2, 2, 1, 0, 2, 2, 2, 1, 1, 0, 1, 0, 5, 4, 2, 1, 1, 0, 2, 1, 1, 0, 1, 0, 2, 1, 2, 1, 1, 0, 2, 1, 1, 0, 2, 2, 3, 3, 1, 0, 4, 4, 4, 4, 5, 5, 1, 0, 2, 2, 1, 0, 1, 0, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,9

COMMENTS

Delete steps are not necessary;

a(n) = 0 iff n is prime: a(A000040(n))=0;

a(A171401(n)) = 1;

A171402 gives smallest numbers m such that a(m)=n: a(A171402(n))=n.

LINKS

R. Zumkeller, Table of n, a(n) for n = 0..2500

Michael Gilleland, Levenshtein Distance

Wikipedia, Levenshtein Distance