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 A368347 #10 Dec 22 2023 10:36:47 %S A368347 1,10,11,2,24,48,69,156,123,4,84,235,67,348,128,103,134,1457,304,308, %T A368347 136,2357,1069,178,3567,10239,126,182,10247,137,13458,12345,567,2458, %U A368347 2068,20567,1378,45689,10348,102347,203479,4568,12456,234568,105689,3089,20689,12678,204589,1048,1023459 %N A368347 a(1) = 1; for n > 1, a(n) is the smallest positive integer that has not yet appeared which contains all the distinct digits of the sum of all previous terms a(1)..a(n-1). %C A368347 The sequence is infinite, although it is unknown if all positive numbers eventually appear. In the first 50000 terms the smallest number not to have appeared is 3. In the same range the largest value is a(49134) = 1023548967, with the sum of all previous terms at that point being 553402987165. %H A368347 Scott R. Shannon, <a href="/A368347/b368347.txt">Table of n, a(n) for n = 1..10000</a> %e A368347 a(3) = 11 as the sum of the first two terms is 1 + 10 = 11, which contains the distinct digit 1, and 11 is the smallest unused number to contain 1. %e A368347 a(4) = 2 as the sum of the first three terms is 1 + 10 + 11 = 22, which contains the distinct digit 2, and 2 is the smallest unused number to contain 2. %e A368347 a(5) = 24 as the sum of the first four terms is 1 + 10 + 11 + 2 = 24, which contains the distinct digits 2 and 4, and 24 is the smallest unused number to contain 2 and 4. %Y A368347 Cf. A368181, A362093, A362075, A342383, A342382. %K A368347 nonn,base %O A368347 1,2 %A A368347 _Scott R. Shannon_, Dec 22 2023