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.

A364143 a(n) is the minimal number of consecutive squares needed to sum to A216446(n).

Table of values

n a(n)
1 2
2 5
3 3
4 2
5 2
6 3
7 10
8 2
9 7
10 9
11 12
12 11
13 6
14 11
15 14
16 3
17 11
18 29
19 14
20 7
21 23
22 4
23 49
24 8
25 24
26 5
27 17
28 12
29 38
30 46
31 27
32 34
33 6
34 14
35 22
36 66
37 11
38 66
39 14
40 11
41 6
42 77
43 36
44 63
45 96
46 11
47 50
48 3
49 19
50 96
51 52
52 41
53 66
54 33
55 11
56 3
57 14
58 121
59 66
60 89
61 34
62 127
63 51
64 2
65 86
66 54
67 181
68 48
69 8

List of values

[2, 5, 3, 2, 2, 3, 10, 2, 7, 9, 12, 11, 6, 11, 14, 3, 11, 29, 14, 7, 23, 4, 49, 8, 24, 5, 17, 12, 38, 46, 27, 34, 6, 14, 22, 66, 11, 66, 14, 11, 6, 77, 36, 63, 96, 11, 50, 3, 19, 96, 52, 41, 66, 33, 11, 3, 14, 121, 66, 89, 34, 127, 51, 2, 86, 54, 181, 48, 8]

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

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