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.

A245869 T(n,k)=Number of length n+2 0..k arrays with some pair in every consecutive three terms totalling exactly k.

Table of values

n a(n)
1 6
2 19
3 10
4 36
5 45
6 16
7 61
8 100
9 103
10 26
11 90
12 193
13 256
14 239
15 42
16 127
17 318
18 549
19 676
20 553
21 68
22 168
23 493
24 960
25 1629
26 1764
27 1281
28 110
29 217
30 712
31 1579
32 3102
33 4753
34 4624
35 2967
36 178
37 270
38 993
39 2368
40 5515
41 9726
42 13961
43 12100
44 6873
45 288
46 331
47 1330
48 3433
49 8840
50 18505
51 30900

List of values

[6, 19, 10, 36, 45, 16, 61, 100, 103, 26, 90, 193, 256, 239, 42, 127, 318, 549, 676, 553, 68, 168, 493, 960, 1629, 1764, 1281, 110, 217, 712, 1579, 3102, 4753, 4624, 2967, 178, 270, 993, 2368, 5515, 9726, 13961, 12100, 6873, 288, 331, 1330, 3433, 8840, 18505, 30900]

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

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