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 A119805 #10 Nov 01 2024 21:08:32
%S A119805 1,1,2,1,3,1,1,0,5,1,1,0,1,0,0,0,8,1,1,0,1,0,0,1,0,0,0,0,0,0,0,0,12,1,
%T A119805 1,0,1,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,1,1,0,
%U A119805 1,0,0,1,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A119805 a(1) = 1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = number of earlier terms of the sequence which equal k.
%e A119805 8 = 2^2 + 4; so for a(8) we want the number of terms among terms a(1), a(2),... a(7) which equal 4. So a(8) = 0.
%o A119805 (PARI) A119805(mmax)= { local(a,ncopr); a=[1]; for(m=0,mmax, for(k=1,2^m, ncopr=0; for(i=1,2^m+k-1, if( a[i]==k, ncopr++; ); ); a=concat(a,ncopr); ); ); return(a); } { print(A119805(6)); } \\ _R. J. Mathar_, May 30 2006
%Y A119805 Cf. A119804.
%K A119805 easy,nonn
%O A119805 1,3
%A A119805 _Leroy Quet_, May 24 2006
%E A119805 More terms from _R. J. Mathar_, May 30 2006