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.

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

Table of values

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

List of values

[0, 2, 2, 2, 8, 2, 2, 8, 2, 2, 8, 2, 7, 26, 2, 2, 8, 18, 2, 8, 2, 2, 17, 2, 30, 8, 2, 43, 8, 2, 2, 8, 32, 2, 8, 2, 2, 68, 18, 2, 80, 2, 32, 8, 2, 37, 8, 13, 2, 17, 2, 2, 92, 2, 2, 8, 2, 78, 44, 60, 112, 8, 57, 2, 8, 2, 128, 53, 2, 2, 8, 85, 32, 50, 2, 2, 53, 63, 2, 8, 151]

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

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