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.

A118656 If C represents the minimum number of segments required to construct n unit cubes, then this sequence represents the number of additional segments required to construct n+1 unit cubes. First differences of sequence A117227.

Table of values

n a(n)
1 12
2 8
3 8
4 5
5 8
6 5
7 5
8 3
9 8
10 5
11 5
12 3
13 8
14 5
15 5
16 3
17 5
18 3
19 8
20 5
21 5
22 3
23 5
24 3
25 5
26 3
27 3

List of values

[12, 8, 8, 5, 8, 5, 5, 3, 8, 5, 5, 3, 8, 5, 5, 3, 5, 3, 8, 5, 5, 3, 5, 3, 5, 3, 3]