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.

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

Table of values

n a(n)
1 6
2 18
3 10
4 48
5 36
6 16
7 96
8 148
9 72
10 26
11 174
12 380
13 460
14 144
15 42
16 282
17 862
18 1512
19 1436
20 288
21 68
22 432
23 1652
24 4272
25 6040
26 4488
27 576
28 110
29 624
30 2956
31 9684
32 21182
33 24160
34 14040
35 1152
36 178
37 870
38 4860
39 20236
40 56782
41 105026
42 96736
43 43940
44 2304
45 288
46 1170
47 7642
48 37868

List of values

[6, 18, 10, 48, 36, 16, 96, 148, 72, 26, 174, 380, 460, 144, 42, 282, 862, 1512, 1436, 288, 68, 432, 1652, 4272, 6040, 4488, 576, 110, 624, 2956, 9684, 21182, 24160, 14040, 1152, 178, 870, 4860, 20236, 56782, 105026, 96736, 43940, 2304, 288, 1170, 7642, 37868]