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.

A372905 Number of solutions for A330279 (numbers k such that x^k == k (mod k + 1) has multiple solutions for 0 <= x < k).

Table of values

n a(n)
1 2
2 2
3 4
4 2
5 2
6 2
7 2
8 2
9 2
10 2
11 2
12 4
13 4
14 8
15 2
16 2
17 6
18 2
19 2
20 4
21 2
22 10
23 2
24 14
25 2
26 2
27 2
28 2
29 2
30 6
31 8
32 4
33 8
34 2
35 4
36 2
37 2
38 2
39 4
40 2
41 2
42 2
43 2
44 2
45 14
46 4
47 2
48 2
49 26
50 2
51 6
52 2
53 2
54 2
55 2
56 4
57 2
58 14
59 2
60 6
61 2
62 2
63 4
64 2
65 2
66 2
67 2
68 2
69 2
70 2
71 4
72 8
73 38
74 2
75 2
76 2
77 10
78 2
79 4
80 2
81 2
82 10
83 4
84 2

List of values

[2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 8, 2, 2, 6, 2, 2, 4, 2, 10, 2, 14, 2, 2, 2, 2, 2, 6, 8, 4, 8, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 14, 4, 2, 2, 26, 2, 6, 2, 2, 2, 2, 4, 2, 14, 2, 6, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 8, 38, 2, 2, 2, 10, 2, 4, 2, 2, 10, 4, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.