1,5

Table of n, a(n) for n=1..83.

Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane]

a(n) = LevenshteinDistance(A000079(n), A004094(n)).

n=19: 2^19 = 524288=[5]24288 -> 824288=[]824288 ->

8824288=882428[8] -> 882428=88242[8] -> 882425=A004094(19):

a(19) = #{subst[5->8], ins[8], del[8], subst[8->5]} = 4.

Sequence in context: A118177 A105069 A172008 * A216452 A307616 A202709

Adjacent sequences: A100822 A100823 A100824 * A100826 A100827 A100828

nonn,base

Reinhard Zumkeller, Jan 06 2005

approved