A261234 - cp's OEIS frontend

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

n	a(n)
0	1
1	2
2	5
3	12
4	29
5	74
6	196
7	530
8	1445
9	3956
10	10862
11	29901
12	82592
13	229233
14	639967
15	1797288
16	5073707
17	14381347
18	40890492
19	116559600
20	333043360
21	953890490
22	2738788806
23	7881915828
24	22729464587
25	65652788211
26	189866467219
27	549596773550
28	1592118137130
29	4615680732717
30	13392399641613
31	38894563977633
32	113074467549440
33	329080350818600
34	958725278344368
35	2795854777347489

[1, 2, 5, 12, 29, 74, 196, 530, 1445, 3956, 10862, 29901, 82592, 229233, 639967, 1797288, 5073707, 14381347, 40890492, 116559600, 333043360, 953890490, 2738788806, 7881915828, 22729464587, 65652788211, 189866467219, 549596773550, 1592118137130, 4615680732717, 13392399641613, 38894563977633, 113074467549440, 329080350818600, 958725278344368, 2795854777347489]

cp's OEIS Frontend

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

Table of values

List of values