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.

A063394 Border sum triangle, read by rows: Let T(n,0)=T(n,n)=1. In general T(n,m) is the sum of the elements (apart from T(n,m) itself) in the border of the rectangle with vertices T(0,0), T(n-m,0), T(n,m) and T(m,m).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 1
6 1
7 7
8 7
9 1
10 1
11 15
12 19
13 15
14 1
15 1
16 31
17 47
18 47
19 31
20 1
21 1
22 63
23 111
24 131
25 111
26 63
27 1
28 1
29 127
30 255
31 343
32 343
33 255
34 127
35 1
36 1
37 255
38 575
39 863
40 979
41 863
42 575
43 255
44 1
45 1
46 511
47 1279
48 2111
49 2655
50 2655
51 2111
52 1279
53 511
54 1
55 1
56 1023
57 2815
58 5055
59 6943
60 7683
61 6943
62 5055
63 2815
64 1023
65 1

List of values

[1, 1, 1, 1, 3, 1, 1, 7, 7, 1, 1, 15, 19, 15, 1, 1, 31, 47, 47, 31, 1, 1, 63, 111, 131, 111, 63, 1, 1, 127, 255, 343, 343, 255, 127, 1, 1, 255, 575, 863, 979, 863, 575, 255, 1, 1, 511, 1279, 2111, 2655, 2655, 2111, 1279, 511, 1, 1, 1023, 2815, 5055, 6943, 7683, 6943, 5055, 2815, 1023, 1]