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 A026350 #8 Sep 25 2014 21:32:48 %S A026350 1,2,2,3,4,3,5,4,6,7,5,8,9,6,10,7,11,12,8,13,9,14,15,10,16,17,11,18, %T A026350 12,19,20,13,21,22,14,23,15,24,25,16,26,17,27,28,18,29,30,19,31,20,32, %U A026350 33,21,34,22,35,36,23,37,38,24,39,25,40,41,26 %N A026350 a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+m-1, else a(n) = least positive integer that has not yet occurred. %F A026350 a(n+1)=A026242(n)+1, for all n>0. - _M. F. Hasler_, Sep 17 2014 %o A026350 (PARI) A026350=vector(#A026242+1,n,if(n>1,A026242[n-1])+1) \\ Assumes the vector A026242 is defined, cf. there for PARI code. - _M. F. Hasler_, Sep 17 2014 %Y A026350 Cf. A026272. %K A026350 nonn %O A026350 1,2 %A A026350 _Clark Kimberling_