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.

A263233 Triangle read by rows: T(n,k) is the number of partitions of n having k perfect square parts (0<=k<=n).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 2, 1, 2, 1, 0, 1, 3, 3, 1, 2, 1, 0, 1, 3, 4, 3, 1, 2, 1, 0, 1, 5, 4, 5, 3, 1, 2, 1, 0, 1, 5, 8, 4, 5, 3, 1, 2, 1, 0, 1, 8, 8, 9, 4, 5, 3, 1, 2, 1, 0, 1, 9, 12, 9, 9, 4, 5, 3, 1, 2, 1, 0, 1, 13, 15, 13, 10, 9, 4, 5, 3, 1, 2, 1, 0, 1]