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.

A269266 a(n) = 2^n mod 31.

Table of values

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

List of values

[1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 1]

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

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