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.

A299163 a(n) = A000594(n) mod (n+1).

Table of values

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

List of values

[1, 0, 0, 3, 0, 0, 0, 6, 7, 9, 0, 11, 0, 6, 8, 14, 0, 1, 0, 0, 2, 0, 0, 10, 15, 24, 0, 10, 0, 18, 0, 30, 12, 21, 12, 20, 30, 6, 24, 4, 0, 3, 16, 21, 0, 15, 0, 21, 43, 15, 20, 21, 0, 45, 0, 27, 42, 34, 0, 28, 46, 42, 56, 38, 48, 60, 16, 0, 14, 63, 0, 50, 60, 36, 12]

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

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