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.

A277278 a(n) = smallest m for which there is a sequence n = b_1 < b_2 < ... < b_t = m such that b_1 + b_2 +...+ b_t is a perfect square.

Table of values

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

List of values

[0, 1, 4, 6, 4, 10, 10, 9, 14, 9, 14, 13, 13, 18, 18, 18, 16, 19, 22, 23, 23, 27, 27, 26, 25, 25, 28, 33, 32, 35, 34, 33, 35, 38, 38, 40, 36, 42, 42, 42, 41, 48, 48, 47, 51, 50, 50, 49, 52, 49, 57, 57, 59, 59, 58, 58, 63, 63, 63, 62, 61, 66, 66, 67, 64, 73, 73]

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

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