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.

A035454 Number of partitions of n into parts 8k+2 or 8k+3.

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 1
6 2
7 1
8 2
9 2
10 3
11 3
12 4
13 4
14 5
15 5
16 6
17 6
18 8
19 8
20 10
21 11
22 13
23 13
24 16
25 16
26 19
27 20
28 23
29 25
30 29
31 30
32 35
33 37
34 41
35 44
36 50
37 53
38 60
39 64
40 72
41 76
42 85
43 90
44 100
45 107
46 118
47 126
48 140
49 148
50 163
51 174
52 190
53 203
54 223
55 237
56 260
57 277
58 301
59 321
60 349
61 371
62 403
63 430
64 466
65 496
66 537

List of values

[0, 1, 1, 1, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 8, 8, 10, 11, 13, 13, 16, 16, 19, 20, 23, 25, 29, 30, 35, 37, 41, 44, 50, 53, 60, 64, 72, 76, 85, 90, 100, 107, 118, 126, 140, 148, 163, 174, 190, 203, 223, 237, 260, 277, 301, 321, 349, 371, 403, 430, 466, 496, 537]

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

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