cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A253196 Irregular array read by rows. T(n,k) is the number of divisors d of n such that k^2 is the greatest square that divides d, n>=1, 1<=k<=A000188(n).

Table of values

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

List of values

[1, 2, 2, 2, 1, 2, 4, 2, 2, 2, 2, 0, 1, 4, 2, 4, 2, 2, 4, 4, 2, 2, 0, 1, 2, 4, 0, 2, 2, 4, 2, 4, 4, 2, 4, 4, 2, 0, 0, 0, 1, 4, 2, 0, 2, 4, 2, 2, 8, 2, 2, 2, 0, 2, 4, 4, 4, 4, 2, 2, 0, 0, 1, 2, 4, 4, 4, 4, 2, 8, 2, 4, 2, 4, 0, 2, 4, 2, 4, 4, 0, 2, 2, 0, 0, 0, 0, 0, 1, 4, 0, 0, 0, 2, 4, 4, 2, 2, 4, 0, 4, 4, 4, 4, 4, 4, 2, 8, 4]