A074482 - cp's OEIS frontend

A074482 Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.

n	a(n)
0	97
1	97
2	97
3	1
4	3
5	3
6	6
7	6
8	8
9	4
10	1
11	8
12	8
13	3
14	2
15	5
16	17143
17	5
18	3
19	4
20	5
21	316
22	22
23	41
24	28
25	1
26	41
27	41
28	3
29	74
30	39
31	5
32	316
33	37
34	37
35	37
36	12178
37	12178
38	67382
39	67382
40	73191
41	52
42	25
43	51
44	50
45	67382
46	6001
47	25
48	6001
49	51
50	22
51	17
52	2
53	5
54	23
55	50
56	1
57	50
58	50
59	14
60	50
61	492
62	20
63	50
64	20
65	52
66	17
67	17143

[97, 97, 97, 1, 3, 3, 6, 6, 8, 4, 1, 8, 8, 3, 2, 5, 17143, 5, 3, 4, 5, 316, 22, 41, 28, 1, 41, 41, 3, 74, 39, 5, 316, 37, 37, 37, 12178, 12178, 67382, 67382, 73191, 52, 25, 51, 50, 67382, 6001, 25, 6001, 51, 22, 17, 2, 5, 23, 50, 1, 50, 50, 14, 50, 492, 20, 50, 20, 52, 17, 17143]

cp's OEIS Frontend

A074482 Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.

Table of values

List of values