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 A119804 #14 Nov 04 2024 18:36:34
%S A119804 0,1,1,2,1,3,1,1,1,6,1,1,0,0,1,0,4,9,1,1,1,0,1,0,0,1,0,0,0,0,0,0,13,
%T A119804 14,1,1,1,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36,21,
%U A119804 1,1,1,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0
%N A119804 a(0) = 0. For m >= 0 and 0 <= k <= 2^m -1, a(2^m +k) = number of earlier terms of the sequence which equal k.
%H A119804 John Tyler Rascoe, <a href="/A119804/b119804.txt">Table of n, a(n) for n = 0..8192</a>
%e A119804 8 = 2^3 + 0; so for a(8) we want the number of terms among terms a(1), a(2),... a(7) which equal 0. So a(8) = 1.
%o A119804 (PARI) A119804(mmax)= { local(a,ncopr); a=[0]; for(m=0,mmax, for(k=0,2^m-1, ncopr=0; for(i=1,2^m+k, if( a[i]==k, ncopr++; ); ); a=concat(a,ncopr); ); ); return(a); } { print(A119804(6)); } \\ _R. J. Mathar_, May 30 2006
%Y A119804 Cf. A000079, A119474, A119802, A119805.
%K A119804 easy,nonn
%O A119804 0,4
%A A119804 _Leroy Quet_, May 24 2006
%E A119804 More terms from _R. J. Mathar_, May 30 2006