A074483 - cp's OEIS frontend

A074483 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 y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y.

n	a(n)
0	397
1	396
2	395
3	4
4	11
5	10
6	25
7	24
8	29
9	14
10	5
11	26
12	25
13	10
14	7
15	16
16	68265
17	14
18	13
19	12
20	17
21	1220
22	67
23	136
24	93
25	6
26	133
27	132
28	9
29	272
30	129
31	14
32	1209
33	126
34	125
35	124
36	48605
37	48604
38	269393
39	269392
40	292695
41	180
42	77
43	178
44	177
45	269386
46	24017
47	72
48	24015
49	172
50	67
51	44
52	11
53	16
54	65

[397, 396, 395, 4, 11, 10, 25, 24, 29, 14, 5, 26, 25, 10, 7, 16, 68265, 14, 13, 12, 17, 1220, 67, 136, 93, 6, 133, 132, 9, 272, 129, 14, 1209, 126, 125, 124, 48605, 48604, 269393, 269392, 292695, 180, 77, 178, 177, 269386, 24017, 72, 24015, 172, 67, 44, 11, 16, 65]

cp's OEIS Frontend

A074483 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 y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y.

Table of values

List of values