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 A254593 #28 Oct 17 2018 08:59:00
%S A254593 6,3,2,3,6,13,30,75,200,555,1590,4693,14202,43863,137882,440235,
%T A254593 1424958,4668304,15459366,51692379,174362770,592815459,2030105382,
%U A254593 6998177293,24270836436,84646997613,296744311172,1045283877639,3698462401026,13140509079977,46869358523238,167781751129899
%N A254593 a(n) = (3/n^3) * Sum_{d|n} (-1)^(n+d)*moebius(n/d)*binomial(2*d,d).
%H A254593 G. C. Greubel, <a href="/A254593/b254593.txt">Table of n, a(n) for n = 1..1650</a>
%H A254593 R. R. Aidagulov, M. A. Alekseyev. On p-adic approximation of sums of binomial coefficients. Journal of Mathematical Sciences 233:5 (2018), 626-634. doi:<a href="http://doi.org/10.1007/s10958-018-3948-0">10.1007/s10958-018-3948-0</a> arXiv:<a href="http://arxiv.org/abs/1602.02632">1602.02632</a>
%H A254593 M. Kontsevich, R. Stanley, O. Gorodetsky, et al. <a href="http://mathoverflow.net/q/195339">A congruence involving binomial coefficients</a>, Mathoverflow, 2015.
%F A254593 a(n) = 6*A131868(n)/n.
%F A254593 For n == 0, 1, or 3 (mod 4), a(n) = A268592(n)/2; for n == 2 (mod 4), a(n) = A268592(n)/2 + A268592(n/2)/8.
%t A254593 a[n_] := 3/n^3 DivisorSum[n, (-1)^(n+#) MoebiusMu[n/#] Binomial[2#, #]&]; Array[a, 40] (* _Jean-François Alcover_, Dec 18 2015 *)
%o A254593 (PARI) { a(n) = sumdiv(n,d,(-1)^(n+d)*moebius(n/d)*binomial(2*d,d))*3/n^3 }
%K A254593 nonn
%O A254593 1,1
%A A254593 _Max Alekseyev_, Feb 01 2015