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.

A128909 3D version of A005670. The problem is to dissect an n X n X n cube into smaller integer cubes, the gcd of whose sides is 1, using the smallest number of cubes. The gcd condition exclude dissecting a 6 X 6 X 6 cube into eight 3 X 3 X 3 cubes.

Table of values

n a(n)
1 1
2 8
3 20
4 15
5 50
6 27
7 71
8 22
9 39
10 57
11 125
12 34

List of values

[1, 8, 20, 15, 50, 27, 71, 22, 39, 57, 125, 34]

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

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