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.

A176850 a(n,k) is the number of ways to choose integers i,j from {0,1,...,k} such that the inequalities |i-j| <= n <= i+j are satisfied.

Table of values

n a(n)
0 1
1 2
2 3
3 1
4 3
5 6
6 6
7 3
8 1
9 4
10 9
11 11
12 10
13 6
14 3
15 1
16 5
17 12
18 16
19 17
20 15
21 10
22 6
23 3
24 1
25 6
26 15
27 21
28 24
29 24
30 21
31 15
32 10
33 6
34 3
35 1
36 7
37 18
38 26
39 31
40 33
41 32
42 28
43 21
44 15
45 10
46 6
47 3
48 1
49 8
50 21
51 31
52 38
53 42
54 43
55 41
56 36
57 28
58 21
59 15
60 10
61 6
62 3
63 1
64 9
65 24
66 36
67 45
68 51
69 54
70 54
71 51
72 45
73 36
74 28
75 21
76 15
77 10
78 6
79 3
80 1
81 10
82 27
83 41
84 52
85 60
86 65
87 67
88 66
89 62
90 55
91 45
92 36
93 28
94 21
95 15
96 10
97 6
98 3

List of values

[1, 2, 3, 1, 3, 6, 6, 3, 1, 4, 9, 11, 10, 6, 3, 1, 5, 12, 16, 17, 15, 10, 6, 3, 1, 6, 15, 21, 24, 24, 21, 15, 10, 6, 3, 1, 7, 18, 26, 31, 33, 32, 28, 21, 15, 10, 6, 3, 1, 8, 21, 31, 38, 42, 43, 41, 36, 28, 21, 15, 10, 6, 3, 1, 9, 24, 36, 45, 51, 54, 54, 51, 45, 36, 28, 21, 15, 10, 6, 3, 1, 10, 27, 41, 52, 60, 65, 67, 66, 62, 55, 45, 36, 28, 21, 15, 10, 6, 3]