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.

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

Table of values

n a(n)
1 16
2 60
3 64
4 190
5 225
6 256
7 512
8 608
9 840
10 1024
11 1212
12 1408
13 2028
14 3136
15 4096
16 2592
17 2936
18 4184
19 6552
20 11704
21 16384
22 5115
23 5664
24 7834
25 12549
26 20955
27 43681
28 65536
29 9460
30 10280
31 13720
32 21860
33 35540
34 68120
35 163020
36 262144
37 16588
38 17754
39 22866
40 35704

List of values

[16, 60, 64, 190, 225, 256, 512, 608, 840, 1024, 1212, 1408, 2028, 3136, 4096, 2592, 2936, 4184, 6552, 11704, 16384, 5115, 5664, 7834, 12549, 20955, 43681, 65536, 9460, 10280, 13720, 21860, 35540, 68120, 163020, 262144, 16588, 17754, 22866, 35704]

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

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