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.

A161090 Number of partitions of n into squares where every part appears at least 2 times.

Table of values

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

List of values

[0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 3, 5, 4, 6, 5, 6, 6, 7, 6, 8, 8, 9, 9, 11, 10, 13, 11, 14, 14, 16, 15, 18, 18, 20, 19, 22, 22, 25, 24, 27, 28, 32, 29, 36, 34, 39, 38, 42, 42, 47, 45, 51, 51, 56, 55, 62, 61, 68, 66, 75, 73, 82, 79, 88, 88, 96, 93, 104, 105, 112, 113, 122, 123]