The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A171401 Numbers m such that exactly one editing step (insert or substitute) is necessary to transform the binary representation of m into the least prime not less than m. 3
 0, 1, 4, 6, 9, 10, 12, 16, 18, 21, 22, 25, 28, 30, 33, 36, 40, 42, 45, 46, 49, 52, 57, 58, 60, 65, 66, 69, 70, 72, 75, 77, 78, 81, 82, 88, 96, 100, 102, 105, 106, 108, 112, 119, 123, 125, 126, 129, 130, 136, 138, 145, 148, 150, 153, 156, 161, 162, 165, 166, 169, 172 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A171400(a(n))=1; BinaryLevenshteinDistance(a(n),A007918(a(n)))=1; A006093 is a subsequence apart from the second term A006093(2)=2; A036987((a(n) XOR A007918(a(n))) - 1) = 1 for n<>2. LINKS R. Zumkeller, Table of n, a(n) for n = 1..700 Michael Gilleland, Levenshtein Distance Wikipedia, Levenshtein Distance CROSSREFS Sequence in context: A339424 A175127 A174166 * A120329 A182800 A123249 Adjacent sequences:  A171398 A171399 A171400 * A171402 A171403 A171404 KEYWORD base,nonn AUTHOR Reinhard Zumkeller, Dec 08 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 28 09:09 EDT 2022. Contains 354112 sequences. (Running on oeis4.)