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 A096087 #10 Sep 03 2020 06:42:21
%S A096087 0,1,0,1,2,0,1,3,0,1,2,3,4,0,1,2,3,4,5,0,1,6,0,1,3,5,7,0,1,8,0,1,2,3,
%T A096087 4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,10,0,1,3,4,5,7,8,9,11,0,1,5,8,12,0,1,
%U A096087 6,7,8,13,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,0,1,3,5,7,8,9,11,13,15,0,1,2,3
%N A096087 Triangle read by rows: row n lists cubic remainders modulo n.
%C A096087 Modulo 7 and 9 there are surprisingly few cubic remainders.
%e A096087 Irregular array begins:
%e A096087 0, 1;
%e A096087 0, 1, 2;
%e A096087 0, 1, 3;
%e A096087 0, 1, 2, 3, 4;
%e A096087 0, 1, 2, 3, 4, 5;
%e A096087 0, 1, 6;
%e A096087 0, 1, 3, 5, 7;
%e A096087 0, 1, 8;
%e A096087 0, 1, 2, 3, 4, 5, 6, 7, 8, 9;
%e A096087 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
%o A096087 (PARI) maybecube(n) = { for(x=2,n, b=floor(x-1); a=vector(b+1); for(y=1,b, z=y^3%x; if(z<>0, a[y]=z; ) ); s=vecsort(a); c=1; print1(s[1]","); for(j=2,b+1, if(s[j]<>s[j-1], c++; print1(s[j]",") ) ); ) }
%Y A096087 Cf. A096107.
%K A096087 nonn,tabf
%O A096087 2,5
%A A096087 _Cino Hilliard_, Jul 21 2004
%E A096087 Edited by _Don Reble_, May 07 2006