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.

A248433 T(n,k)=Number of length n+2 0..k arrays with every three consecutive terms having the sum of some two elements equal to twice the third.

Table of values

n a(n)
1 2
2 9
3 2
4 16
5 9
6 2
7 29
8 20
9 9
10 2
11 42
12 45
13 24
14 9
15 2
16 61
17 70
18 69
19 28
20 9
21 2
22 80
23 105
24 118
25 101
26 36
27 9
28 2
29 105
30 140
31 185
32 198
33 165
34 44
35 9
36 2
37 130
38 189
39 252
40 327
41 342
42 261
43 52
44 9
45 2
46 161
47 242
48 357
49 462
50 601
51 590
52 389
53 68
54 9
55 2
56 192
57 301
58 470
59 691
60 884
61 1105
62 1014
63 645
64 84
65 9
66 2
67 229
68 360

List of values

[2, 9, 2, 16, 9, 2, 29, 20, 9, 2, 42, 45, 24, 9, 2, 61, 70, 69, 28, 9, 2, 80, 105, 118, 101, 36, 9, 2, 105, 140, 185, 198, 165, 44, 9, 2, 130, 189, 252, 327, 342, 261, 52, 9, 2, 161, 242, 357, 462, 601, 590, 389, 68, 9, 2, 192, 301, 470, 691, 884, 1105, 1014, 645, 84, 9, 2, 229, 360]