A065852 - cp's OEIS frontend

A065852 Let u be any string of 3 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).

n	a(n)
2	1
3	2
4	3
5	4
6	4
7	5
8	3
9	5
10	4
11	6
12	4
13	6
14	4
15	5
16	5
17	5
18	4
19	6
20	5
21	6
22	5
23	6
24	5
25	6
26	5
27	6
28	5
29	6
30	5
31	6
32	5
33	6
34	6
35	6
36	6
37	6
38	5
39	6
40	6
41	6
42	5
43	6
44	6
45	6
46	6
47	5
48	5
49	6
50	6
51	6
52	6
53	6
54	5
55	6
56	6
57	6
58	5
59	6
60	6
61	6
62	6
63	6
64	6
65	6
66	6
67	6
68	5
69	6
70	6
71	6
72	5
73	6
74	6
75	6
76	6
77	6
78	6
79	6
80	6
81	6
82	6
83	6
84	6
85	6
86	6
87	6
88	6

[1, 2, 3, 4, 4, 5, 3, 5, 4, 6, 4, 6, 4, 5, 5, 5, 4, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 6, 6, 6, 6, 5, 6, 6, 6, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 6, 5, 6, 6, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 6, 6, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6]

cp's OEIS Frontend

A065852 Let u be any string of 3 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).

Table of values

List of values

n	a(n)
2	1
3	2
4	3
5	4
6	4
7	5
8	3
9	5
10	4
11	6
12	4
13	6
14	4
15	5
16	5
17	5
18	4
19	6
20	5
21	6
22	5
23	6
24	5
25	6
26	5
27	6
28	5
29	6
30	5
31	6
32	5
33	6
34	6
35	6
36	6
37	6
38	5
39	6
40	6
41	6
42	5
43	6
44	6
45	6
46	6
47	5
48	5
49	6
50	6
51	6
52	6
53	6
54	5
55	6
56	6
57	6
58	5
59	6
60	6
61	6
62	6
63	6
64	6
65	6
66	6
67	6
68	5
69	6
70	6
71	6
72	5
73	6
74	6
75	6
76	6
77	6
78	6
79	6
80	6
81	6
82	6
83	6
84	6
85	6
86	6
87	6
88	6

n	a(n)
2	1
3	2
4	3
5	4
6	4
7	5
8	3
9	5
10	4
11	6
12	4
13	6
14	4
15	5
16	5
17	5
18	4
19	6
20	5
21	6
22	5
23	6
24	5
25	6
26	5
27	6
28	5
29	6
30	5
31	6
32	5
33	6
34	6
35	6
36	6
37	6
38	5
39	6
40	6
41	6
42	5
43	6
44	6
45	6
46	6
47	5
48	5
49	6
50	6
51	6
52	6
53	6
54	5
55	6
56	6
57	6
58	5
59	6
60	6
61	6
62	6
63	6
64	6
65	6
66	6
67	6
68	5
69	6
70	6
71	6
72	5
73	6
74	6
75	6
76	6
77	6
78	6
79	6
80	6
81	6
82	6
83	6
84	6
85	6
86	6
87	6
88	6

n	a(n)
2	1
3	2
4	3
5	4
6	4
7	5
8	3
9	5
10	4
11	6
12	4
13	6
14	4
15	5
16	5
17	5
18	4
19	6
20	5
21	6
22	5
23	6
24	5
25	6
26	5
27	6
28	5
29	6
30	5
31	6
32	5
33	6
34	6
35	6
36	6
37	6
38	5
39	6
40	6
41	6
42	5
43	6
44	6
45	6
46	6
47	5
48	5
49	6
50	6
51	6
52	6
53	6
54	5
55	6
56	6
57	6
58	5
59	6
60	6
61	6
62	6
63	6
64	6
65	6
66	6
67	6
68	5
69	6
70	6
71	6
72	5
73	6
74	6
75	6
76	6
77	6
78	6
79	6
80	6
81	6
82	6
83	6
84	6
85	6
86	6
87	6
88	6