A089605 - cp's OEIS frontend

A089605 Let P(m) = m/2 if m is even, m + rev(m) if m is odd, where rev(m) is m's base 10 representation reversed. It is conjectured that any number k eventually cycles when P is repeatedly applied to it. Sequence gives number of steps before the cycle is reached.

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

[0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 2, 0, 1, 3, 3, 0, 1, 1, 1, 0, 1, 2, 1, 3, 1, 1, 1, 2, 2, 4, 0, 4, 3, 1, 1, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 3, 3, 2, 1, 4, 3, 2, 0, 2, 2, 2, 1, 3, 1, 3, 1, 5, 1, 0, 3, 5, 2, 4, 3, 2, 1, 2, 2, 3, 0, 3, 4, 3, 1, 2, 1, 3, 3, 2, 2, 2, 4, 2, 1, 3, 2, 2, 1, 4, 4, 4, 0, 3, 0, 2, 2, 5]

cp's OEIS Frontend

A089605 Let P(m) = m/2 if m is even, m + rev(m) if m is odd, where rev(m) is m's base 10 representation reversed. It is conjectured that any number k eventually cycles when P is repeatedly applied to it. Sequence gives number of steps before the cycle is reached.

Table of values

List of values

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

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

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