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.

A198833 The number of inequivalent ways to color the vertices of a regular octahedron using at most n colors.

Table of values

n a(n)
1 1
2 10
3 56
4 220
5 680
6 1771
7 4060
8 8436
9 16215
10 29260
11 50116
12 82160
13 129766
14 198485
15 295240
16 428536
17 608685
18 848046
19 1161280
20 1565620
21 2081156
22 2731135
23 3542276
24 4545100
25 5774275
26 7268976
27 9073260
28 11236456
29 13813570
30 16865705
31 20460496
32 24672560
33 29583961

List of values

[1, 10, 56, 220, 680, 1771, 4060, 8436, 16215, 29260, 50116, 82160, 129766, 198485, 295240, 428536, 608685, 848046, 1161280, 1565620, 2081156, 2731135, 3542276, 4545100, 5774275, 7268976, 9073260, 11236456, 13813570, 16865705, 20460496, 24672560, 29583961]

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

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