This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A283192 #14 Mar 06 2017 17:03:25
%S A283192 1,2,3,4,5,7,6,9,10,8,11,12,13,14,15,16,17,18,20,19,22,21,23,28,24,25,
%T A283192 26,29,30,27,31,32,33,35,34,36,38,37,41,40,39,42,44,52,45,43,46,47,54,
%U A283192 48,51,55,56,49,67,62,50,53,61,58,57,63,64,71,59,66,65
%N A283192 Lexicographically earliest sequence of distinct terms such that the derived sequence s(n)=CarrylessSum{k=1..n}a(k) contains only distinct terms, where CarrylessSum is the analog of summation for carryless addition.
%C A283192 This sequence is a permutation of the natural numbers (with inverse A283194 and fixed points A283206):
%C A283192 - for any k>0, 10^(k-1) is the first k-digit number appearing in this sequence, and the corresponding partial carryless sum is also the first k-digit number appearing in A283193,
%C A283192 - all powers of 10 appear in this sequence, in increasing order,
%C A283192 - if a(m)=10^k, and the least value not yet seen in this sequence, say v, is smaller than 10^k, then a(m+1)=v,
%C A283192 - hence each natural number will eventually appear in this sequence.
%H A283192 Rémy Sigrist, <a href="/A283192/b283192.txt">Table of n, a(n) for n = 1..10000</a>
%H A283192 Rémy Sigrist, <a href="/A283192/a283192.gp.txt">PARI program for A283192</a>
%H A283192 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>
%H A283192 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%Y A283192 Cf. A169890, A283193 (Partial carryless sum), A283194 (Inverse), A283206 (Fixed points).
%K A283192 nonn,base
%O A283192 1,2
%A A283192 _Rémy Sigrist_, Mar 02 2017