A286090 - cp's OEIS frontend

A286090 Square matrix m read by antidiagonals. For j <= i, m[i, j] is how often sqrtint(gpf(c)) = j where i^2 <= c < (i+1)^2; for j >= i, m[i, j] is how often sqrtint(p) = i where p is a prime factor of c counted with multiplicity and i^2 <= c < (i+1)^2.

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

[3, 7, 3, 8, 2, 2, 15, 3, 3, 3, 15, 2, 2, 2, 2, 21, 6, 1, 1, 4, 2, 19, 3, 2, 3, 2, 3, 1, 27, 8, 2, 1, 1, 2, 5, 2, 29, 7, 2, 2, 2, 2, 2, 3, 2, 31, 7, 4, 2, 0, 0, 2, 4, 3, 1, 32, 9, 3, 3, 2, 4, 2, 3, 3, 4, 1, 41, 9, 3, 3, 0, 0, 0, 0, 3, 3, 4, 2, 39, 11, 6, 4, 2, 1]

cp's OEIS Frontend

A286090 Square matrix m read by antidiagonals. For j <= i, m[i, j] is how often sqrtint(gpf(c)) = j where i^2 <= c < (i+1)^2; for j >= i, m[i, j] is how often sqrtint(p) = i where p is a prime factor of c counted with multiplicity and i^2 <= c < (i+1)^2.

Table of values

List of values

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

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

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