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 A341013 #15 Feb 10 2021 08:15:07 %S A341013 1,3,12,16,10,34,43,56,65,78,87,100,236,258,263,285,304,326,340,359, %T A341013 362,395,403,430,447,474,506,528,539,560,582,593,605,623,632,650,708, %U A341013 744,780,807,825,852,870,935,953,1000,1112,1121,1145,1154,1167,1176 %N A341013 The cumulative sum of the prime digits so far in the sequence and the cumulative sum of the nonprime digits so far differ by n for all a(n) values. %C A341013 The prime digits are 2, 3, 5 and 7; the nonprime digits are 0, 1, 4, 6, 8 and 9. %C A341013 This is the lexicographically earliest sequence of distinct integers > 0 having this property. %H A341013 Carole Dubois, <a href="/A341013/b341013.txt">Table of n, a(n) for n = 1..5000</a> %e A341013 Say that the current sequence is S, the cumulative sum at any moment of the prime digits of S is P, the cumulative sum at any moment of the nonprime digits of S is N and the absolute difference |P-N| is D. We would then have: %e A341013 S = 1, 3, 12, 16, 10, 34, 43, 56, 65, 78, 87, 100,... %e A341013 P = 0 3 5 5 5 8 11 16 21 28 35 35 %e A341013 N = 1 1 2 9 10 14 18 24 30 38 46 47 %e A341013 D = 1 2 3 4 5 6 7 8 9 10 11 12 <-- this is = n %Y A341013 Cf. A085562, A085563. %Y A341013 Cf. A341012 (the cumulative sums of even vs odd digits differ by n). %K A341013 base,nonn %O A341013 1,2 %A A341013 _Carole Dubois_ and _Eric Angelini_, Feb 02 2021