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.

A248509 Length of longest sequence of distinct nonzero squares summing to n, or 0 if no such sequence exists.

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

List of values

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

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

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