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.

A231167 a(1) = a(2) = 0, for n>=3: (sum of non-divisors of n) modulo (number of non-divisors of n).

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 1, 2, 1, 0, 2, 0, 1, 8, 6, 0, 0, 0, 0, 12, 1, 0, 0, 8, 1, 16, 20, 0, 19, 0, 23, 20, 1, 24, 8, 0, 1, 24, 26, 0, 25, 0, 32, 21, 1, 0, 26, 18, 38, 32, 38, 0, 31, 40, 36, 36, 1, 0, 30, 0, 1, 31, 15, 48, 37, 0, 50, 44, 47, 0, 33, 0, 1, 35, 56]

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

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