A133612 - cp's OEIS frontend

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

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

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

cp's OEIS Frontend

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

Table of values

List of values

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

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

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