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 A306843 #20 Jun 14 2021 02:32:39
%S A306843 1,9,28,281,126,11592,344,365465,593434,16095134,1332,921113624,2198,
%T A306843 40424993884,27175280778,2137777203097,4914,121331143444050,6860,
%U A306843 6310445825215406,1572228697798262,351047164202718608,12168,20174300460344963864,149975199312626
%N A306843 a(n) = Sum_{d|n} binomial(n,d)^3.
%H A306843 Seiichi Manyama, <a href="/A306843/b306843.txt">Table of n, a(n) for n = 1..1000</a>
%F A306843 If p is prime, a(p) = A001093(p).
%t A306843 a[n_] := DivisorSum[n, Binomial[n, #]^3 &]; Array[a, 25] (* _Amiram Eldar_, Jun 13 2021 *)
%o A306843 (PARI) {a(n) = sumdiv(n, d, binomial(n, d)^3)}
%Y A306843 Sum_{d|n} binomial(n,d)^b: A000005 (b=0), A056045 (b=1), A174462 (b=2), this sequence (b=3).
%Y A306843 Cf. A000172, A001093, A001158.
%K A306843 nonn
%O A306843 1,2
%A A306843 _Seiichi Manyama_, Mar 12 2019