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 A299165 #14 Jan 10 2025 04:34:40
%S A299165 1,0,0,8,0,0,0,24,27,20,12,24,112,126,120,48,180,324,140,0,420,460,24,
%T A299165 360,275,510,0,532,720,390,672,96,318,406,840,612,68,630,144,1480,
%U A299165 1260,1680,676,156,0,344,1296,1344,343,1800,72,392,1566,540,2520,1680
%N A299165 a(n) = A000594(n) mod n*(n+1).
%H A299165 Seiichi Manyama, <a href="/A299165/b299165.txt">Table of n, a(n) for n = 1..10000</a>
%t A299165 a[n_] := Mod[RamanujanTau[n], n*(n+1)]; Array[a, 100] (* _Amiram Eldar_, Jan 10 2025 *)
%o A299165 (PARI) {a(n) = ramanujantau(n)%(n*(n+1))}
%Y A299165 Cf. A000594, A299158, A299163.
%K A299165 nonn
%O A299165 1,4
%A A299165 _Seiichi Manyama_, Feb 04 2018