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 A022879 #8 Mar 30 2012 18:55:51 %S A022879 1,0,1,2,0,2,0,1,3,0,1,3,0,3,0,1,2,0,5,0,1,2,0,2,4,0,2,0,4,2,0,2,3,0, %T A022879 3,0,1,7,0,2,0,1,4,0,3,2,0,4,0,1,5,0,4,0,2,2,0,6,2,0,3,0,2,4,0,1,6,0, %U A022879 2,0,4,4,0,2,0,1,9,0,1,3,0,4,0,2,2,0,5,3,0,5 %N A022879 The number of numbers [ [ ix ]jx ] that equal n, where i >= 1, j >= 1 and x=(1+sqrt(5))/2. a(n)=0 iff n is in Beatty sequence A001950. %H A022879 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %K A022879 nonn %O A022879 1,4 %A A022879 _Clark Kimberling_