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.

A316347 a(n) = n^2 mod(10^m), where m is the number of digits in n (written in base 10).

Table of values

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

List of values

[0, 1, 4, 9, 6, 5, 6, 9, 4, 1, 0, 21, 44, 69, 96, 25, 56, 89, 24, 61, 0, 41, 84, 29, 76, 25, 76, 29, 84, 41, 0, 61, 24, 89, 56, 25, 96, 69, 44, 21, 0, 81, 64, 49, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 0, 21, 44, 69, 96, 25, 56, 89, 24, 61, 0, 41, 84, 29]