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.

A161091 Number of partitions of n into squares where every part appears at least 3 times.

Table of values

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

List of values

[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 2, 2, 3, 4, 3, 3, 4, 5, 4, 4, 6, 6, 5, 6, 7, 8, 7, 7, 8, 10, 8, 8, 11, 11, 10, 11, 13, 13, 13, 13, 15, 18, 15, 16, 20, 21, 19, 21, 23, 24, 24, 24, 27, 30, 28, 28, 33, 36, 33, 35, 39, 42, 41, 42, 45, 49, 47, 48, 55, 56, 54, 58, 63, 67, 65, 66, 72, 78]