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.

A070348 a(n) = 2^n mod 41.

Table of values

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

List of values

[1, 2, 4, 8, 16, 32, 23, 5, 10, 20, 40, 39, 37, 33, 25, 9, 18, 36, 31, 21, 1, 2, 4, 8, 16, 32, 23, 5, 10, 20, 40, 39, 37, 33, 25, 9, 18, 36, 31, 21, 1, 2, 4, 8, 16, 32, 23, 5, 10, 20, 40, 39, 37, 33, 25, 9, 18, 36, 31, 21, 1, 2, 4, 8, 16, 32, 23, 5, 10, 20, 40, 39, 37, 33, 25, 9, 18]

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

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