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.

A037226 a(n) = phi(2n+1) / multiplicative order of 2 mod 2n+1.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 6, 2, 2, 1, 2, 2, 3, 2, 2, 2, 4, 1, 2, 2, 1, 1, 6, 4, 1, 2, 2, 8, 2, 2, 2, 1, 1, 8, 2, 8, 6, 6, 2, 2, 2, 1, 2, 4, 1, 3, 2, 4, 2, 6, 4, 1, 4, 1, 18, 6, 1, 6, 2, 2, 1, 2, 2, 4, 2, 1, 10, 4, 6, 3, 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.