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.

A362370 Triangle read by rows. T(n, k) = ([x^k] P(n, x)) // k! where P(n, x) = Sum_{k=1..n} P(n - k, x) * x if n >= 1 and P(0, x) = 1. The notation 's // t' means integer division and is a shortcut for 'floor(s/t)'.

Table of values

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

List of values

[1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 1, 3, 2, 0, 0, 0, 0, 0, 1, 3, 3, 1, 0, 0, 0, 0, 0, 1, 4, 4, 2, 0, 0, 0, 0, 0, 0, 1, 4, 6, 3, 1, 0, 0, 0, 0, 0, 0, 1, 5, 7, 5, 1, 0, 0, 0, 0, 0, 0, 0, 1, 5, 9, 6, 2, 0, 0, 0, 0, 0, 0, 0]