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.

A182005 Let s(n) = s_3(n) be digit sum of n in base 3. Consider iterations: a_1(n) = s(2^n), a_2(n) = s(2^n+a_1(n)),a_3(n)=s(2^n+a_2(n)),...The sequence lists those n for which these iterations are (eventually) periodic with period > 1.

Table of values

n a(n)
1 5
2 7
3 8
4 17
5 21
6 23
7 26
8 31
9 39
10 40
11 41
12 45
13 49
14 51
15 52
16 53
17 58
18 62
19 64
20 67
21 69
22 78
23 81
24 82
25 84
26 87
27 91
28 93
29 108
30 113
31 115
32 116
33 119
34 121
35 122
36 128
37 131
38 135
39 136
40 139
41 142
42 151
43 152
44 155
45 163
46 170
47 173
48 174
49 178
50 181
51 191
52 193
53 195
54 198
55 201

List of values

[5, 7, 8, 17, 21, 23, 26, 31, 39, 40, 41, 45, 49, 51, 52, 53, 58, 62, 64, 67, 69, 78, 81, 82, 84, 87, 91, 93, 108, 113, 115, 116, 119, 121, 122, 128, 131, 135, 136, 139, 142, 151, 152, 155, 163, 170, 173, 174, 178, 181, 191, 193, 195, 198, 201]