A362070 - cp's OEIS frontend

A362070 Let m_min(n, k) be the smallest m such that n divides Product_{t=1..m} RisingFactorial(t, k). a(n) = Sum_{r=1..K(n)} m_min(n, r), where K(n) is the Kempner number A002034(n).

n	a(n)
1	1
2	3
3	6
4	9
5	15
6	6
7	28
8	10
9	16
10	15
11	66
12	9
13	91
14	28
15	15
16	16
17	153
18	16
19	190
20	15
21	28
22	66
23	276
24	10
25	33
26	91
27	29
28	28
29	435
30	15
31	496
32	24
33	66
34	153
35	28
36	16
37	703
38	190
39	91
40	15
41	861
42	28
43	946
44	66
45	18
46	276
47	1128
48	16
49	54
50	33
51	153
52	91
53	1431
54	29
55	66
56	28
57	190

[1, 3, 6, 9, 15, 6, 28, 10, 16, 15, 66, 9, 91, 28, 15, 16, 153, 16, 190, 15, 28, 66, 276, 10, 33, 91, 29, 28, 435, 15, 496, 24, 66, 153, 28, 16, 703, 190, 91, 15, 861, 28, 946, 66, 18, 276, 1128, 16, 54, 33, 153, 91, 1431, 29, 66, 28, 190]

cp's OEIS Frontend

A362070 Let m_min(n, k) be the smallest m such that n divides Product_{t=1..m} RisingFactorial(t, k). a(n) = Sum_{r=1..K(n)} m_min(n, r), where K(n) is the Kempner number A002034(n).

Table of values

List of values