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 A359531 #36 May 10 2023 04:31:07
%S A359531 1,-9,-27,8,-125,243,-343,0,0,1125,-1331,-216,-2197,3087,3375,0,-4913,
%T A359531 0,-6859,-1000,9261,11979,-12167,0,0,19773,0,-2744,-24389,-30375,
%U A359531 -29791,0,35937,44217,42875,0,-50653,61731,59319,0,-68921,-83349,-79507,-10648,0
%N A359531 a(1) = 1, a(2) = -9; a(n) = -n^3 * Sum_{d|n, d < n} a(d) / d^3.
%H A359531 Seiichi Manyama, <a href="/A359531/b359531.txt">Table of n, a(n) for n = 1..10000</a>
%F A359531 a(n) is multiplicative with a(2)= -9, a(4)= 8, a(2^e)= 0 if e>2. a(p)= -p^3, a(p^e)= 0 if e>1, p>2.
%F A359531 G.f. A(x) satisfies x * (1 - x) = Sum_{k>=1} k^3 * A(x^k).
%t A359531 f[p_, e_] := If[e == 1, -p^3, 0]; f[2, e_] := Switch[e, 1, -9, 2, 8, _, 0]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, May 10 2023 *)
%Y A359531 Partial sums give A360658.
%Y A359531 Cf. A092673, A359484, A359485.
%Y A359531 Cf. A334659.
%K A359531 sign,mult
%O A359531 1,2
%A A359531 _Seiichi Manyama_, Apr 01 2023