cp's OEIS Frontend

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.

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.

Original entry on oeis.org

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, 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, 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
Offset: 3

Views

Author

Steven Finch, Dec 02 2013

Keywords

Examples

			a(6)=0 since there are no primitive Dirichlet characters mod 6.
		

Crossrefs

Cf. A007431.