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.

A328416 Smallest k such that (Z/mZ)* = C_2 X C_(2k) has exactly n solutions for m, or 0 if no such k exists, where (Z/mZ)* is the multiplicative group of integers modulo m.

Table of values

n a(n)
0 7
1 4
2 1
3 5
4 2
5 10
6 21
7 6
8 42
9 90
10 150
11 30
12 78
13 210
14 2730
15 690
16 1050

List of values

[7, 4, 1, 5, 2, 10, 21, 6, 42, 90, 150, 30, 78, 210, 2730, 690, 1050]