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.

A110146 a(n) = n^(n+1) mod (n+2).

Table of values

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

List of values

[0, 1, 0, 1, 4, 1, 0, 4, 8, 1, 4, 1, 12, 4, 0, 1, 4, 1, 12, 4, 20, 1, 16, 16, 24, 13, 20, 1, 28, 1, 0, 4, 32, 9, 4, 1, 36, 4, 32, 1, 10, 1, 36, 31, 44, 1, 16, 15, 38, 4, 44, 1, 40, 49, 40, 4, 56, 1, 52, 1, 60, 4, 0, 16, 34, 1, 60, 4, 48, 1, 40, 1, 72, 34, 68, 9]

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

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