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.
%I A332207 #9 Feb 07 2020 11:43:11
%S A332207 1,1,1,2,1,2,2,2,2,3,1,3,2,3,2,4,1,4,3,3,2,4,2,5,3,3,2,5,2,6,2,3,3,6,
%T A332207 2,6,3,4,3,6,1,6,4,5,3,5,2,7,4,5,3,6,2,8,3,4,3,8,2,8,4,4,4,8,3,7,2,6,
%U A332207 4,9,2,8,3,5,5,6,2,10,6,6,3,7,2,10,4,5,3,10
%N A332207 a(n) is the number of 3-factorizations of n.
%C A332207 See Bingham link for definitions.
%H A332207 Giovanni Resta, <a href="/A332207/b332207.txt">Table of n, a(n) for n = 1..10000</a>
%H A332207 Aram Bingham, <a href="https://arxiv.org/abs/2002.02059">Ternary arithmetic, factorization, and the class number one problem</a>, arXiv:2002.02059 [math.NT], 2020. See Table 1 p. 14.
%t A332207 a[n_] := Block[{c=0, z=1}, While[3 z^2 - 3 z + 1 <= n, c += Length@ Solve[ x y z - (x-1) (y-1) (z-1) == n && x >= y >= z, {x, y}, Integers]; z++]; c]; Array[a, 88] (* _Giovanni Resta_, Feb 07 2020 *)
%Y A332207 Cf. A014556.
%K A332207 nonn
%O A332207 1,4
%A A332207 _Michel Marcus_, Feb 07 2020
%E A332207 More terms from _Giovanni Resta_, Feb 07 2020