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.

A276031 Number of edges in the graded poset of the partitions of n taken modulo 3, where a partition into k parts is joined to a partition into k+1 parts if the latter is a refinement of the former.

Table of values

n a(n)
1 0
2 1
3 2
4 5
5 9
6 14
7 21
8 30
9 41
10 54
11 70
12 89
13 110
14 135
15 164
16 195
17 231
18 272
19 315
20 364
21 419
22 476
23 540
24 611
25 684
26 765
27 854
28 945
29 1045
30 1154
31 1265
32 1386
33 1517
34 1650
35 1794
36 1949
37 2106
38 2275
39 2456
40 2639
41 2835
42 3044
43 3255
44 3480
45 3719
46 3960
47 4216
48 4487
49 4760
50 5049
51 5354

List of values

[0, 1, 2, 5, 9, 14, 21, 30, 41, 54, 70, 89, 110, 135, 164, 195, 231, 272, 315, 364, 419, 476, 540, 611, 684, 765, 854, 945, 1045, 1154, 1265, 1386, 1517, 1650, 1794, 1949, 2106, 2275, 2456, 2639, 2835, 3044, 3255, 3480, 3719, 3960, 4216, 4487, 4760, 5049, 5354]