Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118763
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118763 a(n) = smallest number not occurring earlier having in decimal representation to its predecessor Levenshtein distance = 1; a(0)=0. +0
7
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 10, 11, 12, 13, 14, 15, 16, 17, 18, 28, 20, 21, 22, 23, 24, 25, 26, 27, 29, 39, 30, 31, 32, 33, 34, 35, 36, 37, 38, 48, 40, 41, 42, 43, 44, 45, 46, 47, 49, 59, 50, 51, 52, 53, 54, 55, 56, 57, 58, 68, 60, 61, 62, 63, 64, 65, 66, 67, 69, 79, 70, 71 (list; graph; listen)
OFFSET

0,3

COMMENT

Permutation of the natural numbers; inverse: A118764; A118765(n)=a(a(n)); a(A118767(n))=A118767(n);

A118768(n) = a(n+1) - a(n);

LINKS

Michael Gilleland, Levenshtein Distance

R. Zumkeller, Initial values of A118757 for n<=1200

Index entries for sequences that are permutations of the natural numbers

CROSSREFS

Cf. A118757.

Adjacent sequences: A118760 A118761 A118762 this_sequence A118764 A118765 A118766

Sequence in context: A066565 A095966 A092596 this_sequence A098488 A003100 A118757

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 01 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research