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.

A350530 Square array read by antidiagonals downwards: T(n,k) is the number of sequences of length n with terms in 0..k such that the (n-1)-st difference is zero, but no earlier iterated difference is zero, n, k >= 1.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 0, 0, 0, 1, 4, 2, 0, 0, 0, 1, 5, 4, 0, 0, 0, 0, 1, 6, 8, 0, 0, 0, 0, 0, 1, 7, 12, 4, 0, 0, 0, 0, 0, 1, 8, 18, 12, 8, 4, 0, 0, 0, 0, 1, 9, 24, 28, 36, 28, 4, 0, 0, 0, 0, 1, 10, 32, 52, 84, 116, 48, 16, 0, 0, 0, 0]