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.

A244799 Number of moduli m such that (prime(n) mod m) is odd, where 1 <= m < prime(n).

Table of values

n a(n)
1 0
2 1
3 2
4 4
5 6
6 8
7 9
8 12
9 14
10 17
11 21
12 23
13 25
14 29
15 29
16 33
17 37
18 41
19 42
20 46
21 49
22 51
23 52
24 56
25 62
26 64
27 68
28 66
29 70
30 74
31 83
32 86
33 86
34 90
35 93
36 99
37 103
38 108
39 106
40 111
41 113
42 119
43 123
44 125
45 124
46 130
47 139
48 147
49 144
50 148
51 148
52 156
53 160
54 163
55 164
56 168
57 174
58 182
59 180
60 182

List of values

[0, 1, 2, 4, 6, 8, 9, 12, 14, 17, 21, 23, 25, 29, 29, 33, 37, 41, 42, 46, 49, 51, 52, 56, 62, 64, 68, 66, 70, 74, 83, 86, 86, 90, 93, 99, 103, 108, 106, 111, 113, 119, 123, 125, 124, 130, 139, 147, 144, 148, 148, 156, 160, 163, 164, 168, 174, 182, 180, 182]