A104244 - cp's OEIS frontend

A104244 Suppose m = Product_{i=1..k} p_i^e_i, where p_i is the i-th prime number and each e_i is a nonnegative integer. Then we can define P_m(x) = Sum_{i=1..k} e_i*x^(i-1). The sequence is the square array A(n,m) = P_m(n) read by descending antidiagonals.

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

[0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 1, 2, 3, 1, 0, 2, 4, 2, 4, 1, 0, 1, 3, 9, 2, 5, 1, 0, 3, 8, 4, 16, 2, 6, 1, 0, 2, 3, 27, 5, 25, 2, 7, 1, 0, 2, 4, 3, 64, 6, 36, 2, 8, 1, 0, 1, 5, 6, 3, 125, 7, 49, 2, 9, 1, 0, 3, 16, 10, 8, 3, 216, 8, 64, 2, 10, 1, 0, 1, 4, 81, 17, 10, 3, 343, 9, 81, 2, 11, 1, 0, 2, 32, 5]

cp's OEIS Frontend

A104244 Suppose m = Product_{i=1..k} p_i^e_i, where p_i is the i-th prime number and each e_i is a nonnegative integer. Then we can define P_m(x) = Sum_{i=1..k} e_i*x^(i-1). The sequence is the square array A(n,m) = P_m(n) read by descending antidiagonals.

Table of values

List of values

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

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

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