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.

A035680 Number of partitions of n into parts 8k+1 and 8k+3 with at least one part of each type.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 1
7 2
8 2
9 2
10 3
11 3
12 5
13 6
14 6
15 8
16 9
17 9
18 11
19 12
20 15
21 18
22 19
23 23
24 26
25 27
26 31
27 34
28 39
29 45
30 49
31 56
32 62
33 66
34 74
35 80
36 89
37 101
38 109
39 123
40 136
41 144
42 160
43 173
44 187
45 210
46 227
47 249
48 275
49 293
50 319
51 346
52 371
53 408
54 442
55 480
56 525
57 562
58 608
59 655
60 701
61 763
62 822
63 887
64 963

List of values

[0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 5, 6, 6, 8, 9, 9, 11, 12, 15, 18, 19, 23, 26, 27, 31, 34, 39, 45, 49, 56, 62, 66, 74, 80, 89, 101, 109, 123, 136, 144, 160, 173, 187, 210, 227, 249, 275, 293, 319, 346, 371, 408, 442, 480, 525, 562, 608, 655, 701, 763, 822, 887, 963]

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

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