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 A122179 #10 Nov 08 2018 07:42:11
%S A122179 0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,0,2,0,0,1,1,0,1,0,2,0,0,
%T A122179 0,3,0,0,0,2,0,1,0,1,1,0,0,4,0,1,0,1,0,2,0,2,0,0,0,4,0,0,1,3,0,1,0,1,
%U A122179 0,1,0,6,0,0,1,1,0,1,0,4,1,0,0,4,0,0,0,2,0,4,0,1,0,0,0,6,0,1,1,3,0,1,0,2,1
%N A122179 Number of ways to write n as n = x*y*z with 1<x<=y<=z<n.
%C A122179 x,y,z are proper factors of n. a(n) > 0 iff n is a term of A033942; a(n) = 0 iff n is a term of A037143.
%H A122179 Seiichi Manyama, <a href="/A122179/b122179.txt">Table of n, a(n) for n = 1..8192</a> (terms 1..2048 from Antti Karttunen)
%e A122179 a(24) = 2 because 24 = 2*2*6 = 2*3*4, two products of three proper factors of 24.
%o A122179 (PARI) for(n=1,105, t=0; for(x=2,n-1, for(y=x,n-1, for(z=y,n-1, if(x*y*z==n, t++)))); print1(t,", "))
%o A122179 (PARI) A122179(n) = { my(s=0); fordiv(n, x, if((x>1)&&(x<n),for(y=x, n-1, for(z=y, n-1, if(x*y*z==n, s++))))); (s); }; \\ _Antti Karttunen_, Aug 24 2017
%Y A122179 Cf. A034836, A033942, A037143, A088432, A088433, A088434, A122180.
%K A122179 nonn
%O A122179 1,24
%A A122179 _Rick L. Shepherd_, Aug 23 2006