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.

A069705 a(n) = 2^n mod 7.

Table of values

n a(n)
0 1
1 2
2 4
3 1
4 2
5 4
6 1
7 2
8 4
9 1
10 2
11 4
12 1
13 2
14 4
15 1
16 2
17 4
18 1
19 2
20 4
21 1
22 2
23 4
24 1
25 2
26 4
27 1
28 2
29 4
30 1
31 2
32 4
33 1
34 2
35 4
36 1
37 2
38 4
39 1
40 2
41 4
42 1
43 2
44 4
45 1
46 2
47 4
48 1
49 2
50 4
51 1
52 2
53 4
54 1
55 2
56 4
57 1
58 2
59 4
60 1
61 2
62 4
63 1
64 2
65 4
66 1
67 2
68 4
69 1
70 2
71 4
72 1
73 2
74 4
75 1
76 2
77 4
78 1
79 2
80 4
81 1
82 2
83 4
84 1
85 2
86 4
87 1
88 2
89 4
90 1
91 2
92 4
93 1
94 2
95 4
96 1
97 2
98 4
99 1
100 2
101 4
102 1
103 2
104 4

List of values

[1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4, 1, 2, 4]

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

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