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.

A247257 The number of octic characters modulo n.

Table of values

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

List of values

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

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

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