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.

A090723 a(1) = 1; for n > 1, number of partitions of n into distinct odd parts such that the two largest parts differ by 2.

Table of values

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

List of values

[1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 2, 1, 1, 3, 3, 1, 2, 4, 3, 2, 3, 5, 5, 3, 4, 7, 6, 4, 6, 9, 8, 6, 8, 11, 11, 9, 10, 15, 15, 11, 14, 19, 18, 16, 19, 24, 24, 21, 24, 31, 31, 27, 32, 40, 39, 36, 41, 49, 50, 47, 52, 63, 64, 59, 67, 79, 79, 77, 85, 98, 101, 97, 106]