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.

A064391 Triangle T(n,k) with zeroth row {1} and row n for n >= 1 giving number of partitions of n with crank k, for -n <= k <= n.

Table of values

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

List of values

[1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 3, 2, 3, 2, 3, 2, 3, 1, 2, 1, 1, 0, 1, 1, 0, 1, 1, 2]