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 A359455 #33 Aug 14 2023 01:59:28
%S A359455 1,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,3,
%T A359455 2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2,3,3,2,2,2,2,2,2,2,3,2,3,
%U A359455 2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,3,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2
%N A359455 Expansion of Sum_{k>0} x^k / (1 - x^(k^3)).
%C A359455 Number of divisors d of n such that d^3 | (n - d).
%H A359455 Seiichi Manyama, <a href="/A359455/b359455.txt">Table of n, a(n) for n = 1..10000</a>
%t A359455 a[n_] := DivisorSum[n, 1 &, Divisible[n-#, #^3] &]; Array[a, 100] (* _Amiram Eldar_, Aug 14 2023 *)
%o A359455 (PARI) a(n) = sumdiv(n, d, (n-d)%d^3==0);
%Y A359455 Cf. A000005, A163671.
%K A359455 nonn,easy
%O A359455 1,2
%A A359455 _Seiichi Manyama_, Jan 06 2023