A125239 - cp's OEIS frontend

A125239 Smallest prime divisor of 10T(n)+1 = 5n*(n+1)+1, where T(n) = 1 + 2 + ... + n.

n	a(n)
1	11
2	31
3	61
4	101
5	151
6	211
7	281
8	19
9	11
10	19
11	661
12	11
13	911
14	1051
15	1201
16	1361
17	1531
18	29
19	1901
20	11
21	2311
22	2531
23	11
24	3001
25	3251
26	3511
27	19
28	31
29	19
30	4651
31	11
32	5281
33	31
34	11
35	6301
36	6661
37	79
38	7411
39	29
40	59
41	79
42	11
43	9461
44	9901
45	11
46	19
47	29
48	19
49	12251
50	41
51	89
52	13781
53	11

[11, 31, 61, 101, 151, 211, 281, 19, 11, 19, 661, 11, 911, 1051, 1201, 1361, 1531, 29, 1901, 11, 2311, 2531, 11, 3001, 3251, 3511, 19, 31, 19, 4651, 11, 5281, 31, 11, 6301, 6661, 79, 7411, 29, 59, 79, 11, 9461, 9901, 11, 19, 29, 19, 12251, 41, 89, 13781, 11]

cp's OEIS Frontend

A125239 Smallest prime divisor of 10T(n)+1 = 5n*(n+1)+1, where T(n) = 1 + 2 + ... + n.

Table of values

List of values

cp's OEIS Frontend

A125239 Smallest prime divisor of 10*T(n)+1 = 5*n*(n+1)+1, where T(n) = 1 + 2 + ... + n.

Table of values

List of values

A125239 Smallest prime divisor of 10T(n)+1 = 5n*(n+1)+1, where T(n) = 1 + 2 + ... + n.