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.

A027350 Number of partitions of n into distinct odd parts, the least being 3.

Table of values

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

List of values

[0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 3, 2, 4, 3, 4, 4, 5, 5, 5, 6, 7, 8, 7, 9, 9, 11, 10, 13, 13, 15, 14, 17, 18, 21, 20, 23, 25, 27, 28, 31, 34, 36, 38, 41, 46, 48, 51, 54, 61, 63, 68, 72, 80, 83, 89, 94, 104, 109, 116]

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

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