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 A232930 #19 Aug 25 2021 13:24:00 %S A232930 2,3,6,0,11,8,8,0,18,5,22,0,11,12,31,0,34,17,10,0,45,20,32,0,24,17,54, %T A232930 0,63,24,21,0,30,20,70,0,27,22,79,0,84,27,24,0,93,20,72,0,36,33,102,0, %U A232930 55,38,37,0,114,27,118,0,52,48,69,0,130,47,42,0,143,40,151,0,32,55,90,0,155,52,72,0,162,33,96,0,57,56,181,0,114,63,58,0,107,40,193,0,72,48,198,0,203,78,39,0,210,60,216,0,79,60,225,0,126,85,100,0,159,46 %N A232930 For each complex primitive Dirichlet character chi modulo n, let f(chi) be the least positive integer k for which chi(k) is not in the set {0,1}. Then a(n) is the sum of f(chi) over all such chi. %H A232930 S. R. Finch, <a href="/A232927/a232927.pdf">Average least nonresidues</a>, December 4, 2013. [Cached copy, with permission of the author] %H A232930 G. Martin and P. Pollack, <a href="http://dx.doi.org/10.1112/jlms/jds036">The average least character non-residue and further variations on a theme of Erdos</a>, J. London Math. Soc. 87 (2013) 22-42. %H A232930 R. J. Mathar, <a href="http://arxiv.org/abs/1008.2547">Table of Dirichlet L-series and prime zeta modulo functions for small moduli</a>, arXiv:1008.2547 [math.NT], 2010-2015. %e A232930 a(6)=0 since there are no primitive Dirichlet characters mod 6. %Y A232930 Cf. A007431. %K A232930 nonn %O A232930 3,1 %A A232930 _Steven Finch_, Dec 02 2013