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 A336206 #15 Jul 14 2020 15:44:41 %S A336206 0,0,0,1,1,2,3,4,5,0,0,0,2,6,6,7,8,9,10,0,3,7,11,11,12,13,14,15,16,0, %T A336206 3,8,12,17,17,18,19,20,21,1,4,11,13,22,22,23,24,25,26,1,7,14,18,27,28, %U A336206 29,30,31,32,2,9,19,33,34,35,36,37,38,39,5,15,40,41 %N A336206 Lexicographically earliest sequence of nonnegative terms such that whenever a(k_1) = ... = a(k_m) with k_1 < ... < k_m, the sum k_1 + ... + k_m can be computed without carries in base 10. %C A336206 This sequence is a decimal variant of A279125. %H A336206 Rémy Sigrist, <a href="/A336206/b336206.txt">Table of n, a(n) for n = 1..10000</a> %H A336206 Rémy Sigrist, <a href="/A336206/a336206.png">Scatterplot of the first 100000 terms</a> %H A336206 Rémy Sigrist, <a href="/A336206/a336206.txt">C program for A336206</a> %F A336206 a(n) = 0 iff n belongs to A278742. %e A336206 We can choose a(1) = a(2) = a(3) = 0 as 1 + 2 + 3 = 6 can be computed without carries. %e A336206 However 1 + 2 + 3 + 4 implies a carry, so a(4) = 1. %o A336206 (C) See Links section. %Y A336206 Cf. A278742, A279125. %K A336206 nonn,look,base %O A336206 1,6 %A A336206 _Rémy Sigrist_, Jul 12 2020