A094670 - cp's OEIS frontend

A094670 Smallest number which requires n iterations to reach 1 in the juggler sequence problem.

n	a(n)
0	1
1	2
2	4
3	16
4	7
5	5
6	3
7	9
8	33
9	19
10	81
11	25
12	353
13	183
14	39
15	201
16	103
17	37
18	205
19	77
20	681
21	263
22	3817
23	429
24	175
25	1673
26	539
27	165
28	671
29	321
30	5875
31	477
32	173
33	2243
34	265
35	29017
36	1011
37	677
38	9361
39	659
40	241
41	3389
42	1123
43	163
44	2057
45	625
46	15271
47	4481

[1, 2, 4, 16, 7, 5, 3, 9, 33, 19, 81, 25, 353, 183, 39, 201, 103, 37, 205, 77, 681, 263, 3817, 429, 175, 1673, 539, 165, 671, 321, 5875, 477, 173, 2243, 265, 29017, 1011, 677, 9361, 659, 241, 3389, 1123, 163, 2057, 625, 15271, 4481]

cp's OEIS Frontend

A094670 Smallest number which requires n iterations to reach 1 in the juggler sequence problem.

Table of values

List of values