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.

A027349 Number of partitions of n into distinct odd parts, the least being 1.

Table of values

n a(n)
1 1
2 0
3 0
4 1
5 0
6 1
7 0
8 1
9 1
10 1
11 1
12 1
13 2
14 1
15 2
16 2
17 3
18 2
19 3
20 3
21 4
22 4
23 4
24 5
25 6
26 6
27 6
28 8
29 8
30 9
31 9
32 11
33 12
34 13
35 13
36 16
37 17
38 18
39 19
40 22
41 24
42 25
43 27
44 30
45 33
46 35
47 37
48 41
49 46
50 47
51 51
52 56
53 61
54 64
55 69
56 75
57 82
58 86
59 92
60 100
61 109
62 114
63 122
64 133
65 143
66 151
67 161
68 174
69 187
70 198

List of values

[1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 4, 4, 5, 6, 6, 6, 8, 8, 9, 9, 11, 12, 13, 13, 16, 17, 18, 19, 22, 24, 25, 27, 30, 33, 35, 37, 41, 46, 47, 51, 56, 61, 64, 69, 75, 82, 86, 92, 100, 109, 114, 122, 133, 143, 151, 161, 174, 187, 198]

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

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