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.

A209434 Table T(n,m), read by antidiagonals, is the number of subsets of {1,...,n} which do not contain two elements whose difference is m+1.

Table of values

n a(n)
0 1
1 2
2 1
3 3
4 2
5 1
6 5
7 4
8 2
9 1
10 8
11 6
12 4
13 2
14 1
15 13
16 9
17 8
18 4
19 2
20 1
21 21
22 15
23 12
24 8
25 4
26 2
27 1
28 34
29 25
30 18
31 16
32 8
33 4
34 2
35 1
36 55
37 40
38 27
39 24
40 16
41 8
42 4
43 2
44 1
45 89
46 64
47 45
48 36
49 32
50 16
51 8
52 4
53 2
54 1
55 144
56 104
57 75
58 54
59 48
60 32
61 16
62 8
63 4
64 2
65 1
66 233
67 169
68 125
69 81
70 72
71 64
72 32

List of values

[1, 2, 1, 3, 2, 1, 5, 4, 2, 1, 8, 6, 4, 2, 1, 13, 9, 8, 4, 2, 1, 21, 15, 12, 8, 4, 2, 1, 34, 25, 18, 16, 8, 4, 2, 1, 55, 40, 27, 24, 16, 8, 4, 2, 1, 89, 64, 45, 36, 32, 16, 8, 4, 2, 1, 144, 104, 75, 54, 48, 32, 16, 8, 4, 2, 1, 233, 169, 125, 81, 72, 64, 32]