cp's OEIS Frontend

A261725 Lexicographically earliest sequence of distinct terms such that the absolute difference of two successive terms is a power of 10, and can be computed without carry.

%I A261725 #14 Apr 25 2016 12:00:16
%S A261725 0,1,2,3,4,5,6,7,8,9,19,18,17,16,15,14,13,12,11,10,20,21,22,23,24,25,
%T A261725 26,27,28,29,39,38,37,36,35,34,33,32,31,30,40,41,42,43,44,45,46,47,48,
%U A261725 49,59,58,57,56,55,54,53,52,51,50,60,61,62,63,64,65,66,67
%N A261725 Lexicographically earliest sequence of distinct terms such that the absolute difference of two successive terms is a power of 10, and can be computed without carry.
%C A261725 In base 10, two successive terms have the same representation, except for one position, where the digits differ from exactly one unit. This difference can occur on a leading zero.
%C A261725 Conjectured to be a permutation of the nonnegative integers. See A261729 for putative inverse.
%C A261725 a(n) = A003100(n) for n < 101, but a(101) = 180, A003100(101) = 191.
%C A261725 a(n) = A118757(n) for n < 201, but a(201) = 281, A118757(201) = 290.
%C A261725 a(n) = A118758(n) for n < 100, but a(100) = 190, A118758(100) = 109.
%C A261725 a(n) = A174025(n) for n < 100, but a(100) = 190, A174025(100) = 199.
%C A261725 a(n) = A261729(n) for n < 100, but a(100) = 190, A261729(100) = 109.
%H A261725 Paul Tek, <a href="/A261725/b261725.txt">Table of n, a(n) for n = 0..10000</a>
%H A261725 Paul Tek, <a href="/A261725/a261725.pl.txt">PERL program for this sequence</a>
%o A261725 (Perl) See Links section.
%Y A261725 Cf. A003100, A118757, A118763, A163252, A261729 (putative inverse).
%K A261725 nonn,base,look
%O A261725 0,3
%A A261725 _Paul Tek_, Aug 30 2015