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.

A191090 a(n)^2 is the largest square required when writing n as a partition of squares.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 2, 1, 1, 4, 2, 3, 1, 2, 2, 2, 1, 2, 5, 2, 3, 2, 2, 2, 2, 4, 2, 3, 2, 6, 2, 2, 2, 2, 4, 2, 3, 2, 3, 2, 2, 4, 7, 5, 2, 4, 2, 3, 2, 2, 4, 3, 3, 2, 5, 2, 3, 8, 4, 4, 3, 4, 2, 3, 2, 6, 4, 5, 5, 3, 4, 2, 3, 4, 9, 4, 3, 4, 6, 5]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.