[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A101222
Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 1.
0
0, 1, 2, 10, 12, 13, 21, 23, 24, 32, 34, 35, 43, 45, 46, 54, 56, 57, 65, 67, 68, 76, 78, 79, 87, 88, 90, 100, 102, 110, 112, 120, 122, 130, 132, 140, 142, 150, 152, 160, 162, 170, 172, 180, 182, 190, 192, 193, 201, 203, 211, 213, 221, 223, 241, 243, 251, 253, 261
OFFSET
0,3
COMMENTS
This is the slowest growing such sequence in the limiting sense; any other such sequence b must eventually have b(n) > a(n) for sufficiently large n. It is not the slowest growing in the greedy or lexical sense. "Slowest growing" in this sense does not necessarily exist for arbitrary properties, but it does in this case. - Franklin T. Adams-Watters, Oct 25 2006
CROSSREFS
Sequence in context: A300907 A327793 A276103 * A349831 A079252 A108064
KEYWORD
base,easy,nonn
AUTHOR
Eric Angelini, Dec 15 2004
STATUS
approved