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.

A318478 Decimal digits such that for all k>=1, the number A(k) := Sum_{n = 0..k-1 } a(n)*10^n satisfies the congruence 1984^A(k) == A(k) (mod 10^k).

Table of values

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

List of values

[6, 1, 6, 3, 0, 7, 8, 9, 3, 0, 7, 1, 4, 5, 9, 1, 2, 0, 3, 2, 9, 4, 8, 4, 0, 0, 1, 0, 9, 0, 4, 5, 1, 0, 2, 3, 9, 2, 0, 5, 0, 9, 4, 2, 6, 9, 0, 5, 3, 3, 8, 6, 2, 2, 8, 4, 6, 3, 8, 5, 1, 9, 2, 3, 7, 7, 8, 9, 0, 0, 2, 8, 3, 9, 2, 7, 0, 0, 1, 0, 7, 4, 9, 0, 3, 3, 5]