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.

A261232 a(n) = number of steps to reach 0 when starting from k = 3^n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).

Table of values

n a(n)
0 1
1 2
2 4
3 9
4 21
5 50
6 124
7 320
8 850
9 2295
10 6251
11 17113
12 47014
13 129606
14 358839
15 998806
16 2796094
17 7869801
18 22251148
19 63141640
20 179701240
21 512744600
22 1466635090
23 4205423896
24 12087339724
25 34816804311
26 100469592522
27 290336059741
28 839932833291
29 2432050970421
30 7047731703138
31 20440131344751
32 59334695322384
33 172409162871824
34 501489513690424

List of values

[1, 2, 4, 9, 21, 50, 124, 320, 850, 2295, 6251, 17113, 47014, 129606, 358839, 998806, 2796094, 7869801, 22251148, 63141640, 179701240, 512744600, 1466635090, 4205423896, 12087339724, 34816804311, 100469592522, 290336059741, 839932833291, 2432050970421, 7047731703138, 20440131344751, 59334695322384, 172409162871824, 501489513690424]