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.

A133618 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 8^A(k) == A(k) (mod 10^k).

Table of values

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

List of values

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