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.

A299173 a(n) is the maximum number of squared consecutive positive integers into which the integer n can be partitioned.

Table of values

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

List of values

[1, 0, 0, 1, 2, 0, 0, 0, 1, 0, 0, 0, 2, 3, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 3, 0, 0, 0, 4, 5, 0, 0, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 0, 0, 2, 4, 0, 0, 0, 5, 6, 0, 0, 0, 0, 0, 0, 0, 0, 1]