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 A160692 #2 Mar 30 2012 18:51:04 %S A160692 0,1,0,2,2,0,0,3,3,3,0,0,0,0,0,4,4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,5,5,5, %T A160692 5,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,6,6,6,6, %U A160692 6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 %N A160692 Iteration of (k terms=k, followed by 2^k-k terms=0), beginning with k=0. %C A160692 For n with 2^k - 1 <= n < 2^k + k-1: a(n) = k; %C A160692 for n with 2^k + k-1 <= n < 2^(k+1) - 1: a(n) = 0. %F A160692 a(n) = f(n,0) with f(n,k) = if n<2^k then (if n<k then k else 0) else f(n-2^k,k+1). %Y A160692 A000225, A083706, A052944, A000918. %K A160692 nonn,tabf %O A160692 0,4 %A A160692 _Reinhard Zumkeller_, May 24 2009