A259527 - cp's OEIS frontend

A259527 a(n) gives the number of sequences n = b_1 < b_2 < ... < b_t = A006255(n) such that b_1b_2...*b_t is a perfect square.

n	a(n)
1	1
2	2
3	2
4	1
5	2
6	2
7	2
8	2
9	1
10	2
11	8
12	2
13	16
14	2
15	2
16	1
17	64
18	2
19	128
20	4
21	2
22	4
23	512
24	2
25	1
26	4
27	1
28	2
29	8192
30	2
31	8192
32	4
33	2
34	16
35	2
36	1
37	65536
38	64
39	4
40	2
41	524288
42	8
43	1048576
44	4
45	4
46	128
47	8388608
48	2
49	1
50	1
51	8
52	2
53	67108864
54	4
55	2
56	2
57	4
58	256
59	536870912
60	2
61	2147483648
62	2048
63	2
64	1
65	1

[1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 8, 2, 16, 2, 2, 1, 64, 2, 128, 4, 2, 4, 512, 2, 1, 4, 1, 2, 8192, 2, 8192, 4, 2, 16, 2, 1, 65536, 64, 4, 2, 524288, 8, 1048576, 4, 4, 128, 8388608, 2, 1, 1, 8, 2, 67108864, 4, 2, 2, 4, 256, 536870912, 2, 2147483648, 2048, 2, 1, 1]

cp's OEIS Frontend

A259527 a(n) gives the number of sequences n = b_1 < b_2 < ... < b_t = A006255(n) such that b_1b_2...*b_t is a perfect square.

Table of values

List of values

cp's OEIS Frontend

A259527 a(n) gives the number of sequences n = b_1 < b_2 < ... < b_t = A006255(n) such that b_1*b_2*...*b_t is a perfect square.

Table of values

List of values

A259527 a(n) gives the number of sequences n = b_1 < b_2 < ... < b_t = A006255(n) such that b_1b_2...*b_t is a perfect square.