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 A205838 #8 Mar 30 2012 18:58:11 %S A205838 1,1,3,2,1,3,4,1,3,4,6,2,5,1,3,4,6,7,1,3,4,6,7,9,2,5,8,1,3,4,6,7,9,10, %T A205838 1,3,4,6,7,9,10,12,2,5,8,11,1,3,4,6,7,9,10,12,13,1,3,4,6,7 %N A205838 The least number j such that 2 divides s(k)-s(j), where k(n)=A205720(n). %C A205838 For a guide to related sequences, see A205840. %e A205838 (See the example at A205587.) %t A205838 (See the program at A205587.) %Y A205838 Cf. A204890, A205587, A205840. %K A205838 nonn %O A205838 1,3 %A A205838 _Clark Kimberling_, Feb 01 2012