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.

A261237 Number of steps needed when starting from (3^(n+1))-1 and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k) to encounter the first number whose base-3 representation begins with a digit other than 2.

Table of values

n a(n)
0 1
1 1
2 2
3 5
4 13
5 34
6 92
7 251
8 687
9 1885
10 5184
11 14292
12 39557
13 110094
14 308351
15 868716
16 2458964
17 6984467
18 19890809
19 56775186
20 162427605
21 465816503
22 1339163192
23 3858600035
24 11138726760
25 32199805820

List of values

[1, 1, 2, 5, 13, 34, 92, 251, 687, 1885, 5184, 14292, 39557, 110094, 308351, 868716, 2458964, 6984467, 19890809, 56775186, 162427605, 465816503, 1339163192, 3858600035, 11138726760, 32199805820]