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.

A133617 Unique sequence of digits a(0), a(1), a(2), ... such that for all k >= 2, the number A(k) := Sum_{n = 0..k-1} a(n)*10^n satisfies 7^A(k) == A(k) (mod 10^k).

Table of values

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

List of values

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