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.

A027360 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, the greatest being >= k.

Table of values

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

List of values

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

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

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