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.

A056968 10^(n-1) modulo n.

Table of values

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

List of values

[0, 0, 1, 0, 0, 4, 1, 0, 1, 0, 1, 4, 1, 10, 10, 0, 1, 10, 1, 0, 16, 10, 1, 16, 0, 10, 19, 20, 1, 10, 1, 0, 1, 10, 25, 28, 1, 10, 22, 0, 1, 40, 1, 32, 10, 10, 1, 16, 8, 0, 49, 12, 1, 46, 45, 24, 43, 10, 1, 40, 1, 10, 37, 0, 55, 10, 1, 48, 31, 20, 1, 64, 1, 10, 25, 12, 67, 4, 1, 0, 73, 10, 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.