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.

A056969 a(n) = 10^n modulo n.

Table of values

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

List of values

[0, 0, 1, 0, 0, 4, 3, 0, 1, 0, 10, 4, 10, 2, 10, 0, 10, 10, 10, 0, 13, 12, 10, 16, 0, 22, 1, 4, 10, 10, 10, 0, 10, 32, 5, 28, 10, 24, 25, 0, 10, 22, 10, 12, 10, 8, 10, 16, 31, 0, 31, 16, 10, 28, 10, 16, 31, 42, 10, 40, 10, 38, 55, 0, 30, 34, 10, 4, 34, 60, 10, 64, 10, 26, 25, 44, 54, 40]

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

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