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.

A376923 T(n, k) = T(n - 1, k) + 2^(n - 1)*T(n - 2, k - 1), if k > 0 and T(n, 0) = 2^n.

Table of values

n a(n)
0 1
1 2
2 0
3 4
4 2
5 0
6 8
7 10
8 0
9 0
10 16
11 42
12 16
13 0
14 0
15 32
16 170
17 176
18 0
19 0
20 0
21 64
22 682
23 1520
24 512
25 0
26 0
27 0
28 128
29 2730
30 12400
31 11776
32 0
33 0
34 0
35 0
36 256
37 10922
38 99696
39 206336
40 65536
41 0
42 0
43 0
44 0
45 512
46 43690
47 798576
48 3380736
49 3080192
50 0
51 0
52 0
53 0
54 0
55 1024
56 174762
57 6390640
58 54425088
59 108724224
60 33554432
61 0
62 0
63 0
64 0
65 0

List of values

[1, 2, 0, 4, 2, 0, 8, 10, 0, 0, 16, 42, 16, 0, 0, 32, 170, 176, 0, 0, 0, 64, 682, 1520, 512, 0, 0, 0, 128, 2730, 12400, 11776, 0, 0, 0, 0, 256, 10922, 99696, 206336, 65536, 0, 0, 0, 0, 512, 43690, 798576, 3380736, 3080192, 0, 0, 0, 0, 0, 1024, 174762, 6390640, 54425088, 108724224, 33554432, 0, 0, 0, 0, 0]