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

A198833

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

Terms

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

External references