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 A106495 #6 Mar 31 2012 13:21:10 %S A106495 1,1,1,1,1,2,1,1,2,2,1,2,1,2,1,1,1,3,1,2,1,2,2,2,1,2,2,2,2,2,1,1,2,2, %T A106495 2,3,1,2,2,2,1,2,2,2,2,3,1,2,2,2,1,2,2,3,1,2,2,3,1,2,1,2,2,2,2,3,1,2, %U A106495 1,3,2,3,1,2,2,2,2,3,2,2,1,2,3,2,2,3,1,2,2,3,1,3,2,2,2,2,1,3,2,2,3,2 %N A106495 Number of leaves in GF(2)[X] superfactorization of n. %H A106495 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %F A106495 a(n) = A106494(n)-A106493(n). %Y A106495 a(n) = A064372(A106445(n)). After n=1 differs from A091221 for the first time at n=64, where A091221(64)=1, while a(64)=2. %K A106495 nonn %O A106495 1,6 %A A106495 _Antti Karttunen_, May 09 2005