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 A319579 #44 Oct 01 2019 10:12:09 %S A319579 2,2,4,6,2,8,10,2,6,8,2,5,7,18,14,8,12,10,2,25,27,2,18,20,2,4,6,12,22, %T A319579 10,24,32,18,14,15,2,5,7,45,34,38,12,3,22,52,25,2,29,31,17,32,3,53,15, %U A319579 56,2,2,4,6,4,46,10,10,50,10,74,49,8,71,52,27,20,60 %N A319579 Lexicographically earliest infinite sequence of positive terms such that for any n >= 0, a(n+1) = a(n + a(n)) - a(n). %C A319579 The smallest legal term is 2, otherwise for a(n) = 1: a(n+1) = a(n + 1) - 1. %H A319579 Rémy Sigrist, <a href="/A319579/b319579.txt">Table of n, a(n) for n = 0..10000</a> %H A319579 Rémy Sigrist, <a href="/A319579/a319579.txt">C++ program for A319579</a> %H A319579 Rémy Sigrist, <a href="/A319579/a319579.png">Scatterplot of the first 100000 terms</a> %F A319579 a(n+1) = a(n + a(n)) - a(n). %e A319579 a(0) = 2, because it's the smallest positive integer that satisfies the rule a(n+1) = a(n + a(n)) - a(n). %e A319579 a(1) = 2, because we have again free choice inside the rules. %e A319579 a(2) = 4, because a(1) = a(0 + a(0)) - a(0) = a(0 + 2) - a(0) = a(2) - 2 = 2. %e A319579 a(3) = 6, because a(2) = a(1 + a(1)) - a(1) = a(1 + 2) - a(1) = a(3) - 2 = 4. %e A319579 a(6) = 10, because a(3) = a(2 + a(2)) - a(2) = a(2 + 4) - a(2) = a(6) - 4 = 6. %e A319579 a(4) = 2, because we have again free choice inside the rules. %e A319579 And so on. %o A319579 (C++) See Links section. %Y A319579 Cf. A309681. %K A319579 nonn %O A319579 0,1 %A A319579 _Marc Morgenegg_, Aug 27 2019 %E A319579 Name amended by _Rémy Sigrist_, Oct 01 2019