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.

A238801 Triangle T(n,k), read by rows, given by T(n,k) = C(n+1, k+1)*(1-(k mod 2)).

Table of values

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

List of values

[1, 2, 0, 3, 0, 1, 4, 0, 4, 0, 5, 0, 10, 0, 1, 6, 0, 20, 0, 6, 0, 7, 0, 35, 0, 21, 0, 1, 8, 0, 56, 0, 56, 0, 8, 0, 9, 0, 84, 0, 126, 0, 36, 0, 1, 10, 0, 120, 0, 252, 0, 120, 0, 10, 0, 11, 0, 165, 0, 462, 0, 330, 0, 55, 0, 1, 12, 0, 220, 0, 792, 0, 792, 0, 220, 0, 12, 0]

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

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