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.

A255107 T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs.

Table of values

n a(n)
1 9
2 26
3 27
4 66
5 75
6 81
7 147
8 168
9 216
10 243
11 294
12 331
13 441
14 622
15 729
16 540
17 597
18 789
19 1137
20 1791
21 2187
22 927
23 1008
24 1302
25 1905
26 2907
27 5157
28 6561
29 1507
30 1616
31 2032
32 2951
33 4429
34 7498
35 14849
36 19683
37 2343
38 2484
39 3042
40 4338
41 6582
42 10125
43 19338
44 42756
45 59049
46 3510

List of values

[9, 26, 27, 66, 75, 81, 147, 168, 216, 243, 294, 331, 441, 622, 729, 540, 597, 789, 1137, 1791, 2187, 927, 1008, 1302, 1905, 2907, 5157, 6561, 1507, 1616, 2032, 2951, 4429, 7498, 14849, 19683, 2343, 2484, 3042, 4338, 6582, 10125, 19338, 42756, 59049, 3510]

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

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