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 A079727 #47 Aug 02 2024 19:08:39
%S A079727 1,9,225,8225,351225,16354233,805243257,41229480825,2172976383825,
%T A079727 117106008311825,6423711336265041,357470875526646609,
%U A079727 20131502573232075025,1145190201805448075025,65706503254247744075025
%N A079727 a(n) = 1 + C(2,1)^3 + C(4,2)^3 + ... + C(2n,n)^3.
%C A079727 a(n) seems to have an interesting congruence property: For p prime, a(p) == 8 (mod p) if and only if p == 3, 5, 7, or 13 (mod 14); i.e., iff p = 7 or p is in A003625.
%C A079727 From _Peter Bala_, Jul 12 2024: (Start)
%C A079727 _Zhi-Wei Sun_ (2010) conjectured that if p is an odd prime such that the Legendre symbol (p/7) = -1 (i.e., if p == 3, 5, 6 (mod 7)) then a(p-1) == 0 (mod p^2). Otherwise, if (p/7) = 1 then a(p-1) == 4*x^2 - 2*p (mod p^2) where p = x^2 + 7*y^2 with x, y in Z.
%C A079727 The author’s twin brother Zhi_Hong Sun confirmed the conjecture in the case (p/7) = -1.
%C A079727 Conjectures: if prime p is in A003625 then
%C A079727 1) a(p^2) == 8 + p^2 (mod p^3)
%C A079727 2) a(p*(p-1)) == p^2 (mod p^3)
%C A079727 3) a((p^2-1)/2) == p^2 (mod p^4) (all checked up to p = 101).
%C A079727 4) if n is a product of distinct primes from A003625 then a((n-1)/2) is divisible by n^2. (End)
%H A079727 Seiichi Manyama, <a href="/A079727/b079727.txt">Table of n, a(n) for n = 0..556</a>
%H A079727 Zhi-Hong Sun, <a href="https://arxiv.org/abs/1012.3898">Congruences concerning Legendre polynomials II"</a>, Theorem 3.2, arXiv:1012.3898v2 [math.NT], 2010-2012.
%H A079727 Zhi-Wei Sun, <a href="https://arxiv.org/abs/0911.5665">Open conjectures on congruences</a>, Part A, conjecture A1, arXiv:0911.5665v59 [math.NT], 2009-2011.
%F A079727 a(n) = Sum_{k=0..n} binomial(2*k,k)^3.
%F A079727 G.f.: hypergeom([1/2, 1/2, 1/2], [1, 1], 64*x)/(1-x). - _Vladeta Jovovic_, Feb 18 2003
%F A079727 G.f.: hypergeom([1/4,1/4],[1],64*x)^2/(1-x). - _Mark van Hoeij_, Nov 17 2011
%F A079727 Recurrence: (n+2)^3*a(n+2)-(5*n+8)*(13*n^2+38*n+28)*a(n+1)+8*(2n+3)^3*a(n)=0. - _Emanuele Munarini_, Nov 15 2016
%F A079727 a(n) ~ 2^(6*n+6) / (63*Pi^(3/2)*n^(3/2)). - _Vaclav Kotesovec_, Nov 16 2016
%t A079727 Table[Sum[Binomial[2 k, k]^3, {k, 0, n}], {n, 0, 14}] (* _Michael De Vlieger_, Nov 15 2016 *)
%o A079727 (PARI) a(n)=sum(k=0,n,binomial(2*k,k)^3)
%o A079727 (Maxima) makelist(sum(binomial(2*k,k)^3,k,0,n),n,0,12); /* _Emanuele Munarini_, Nov 15 2016 */
%o A079727 (Magma) [&+[Binomial(2*k, k)^3: k in [0..n]]: n in [0..20]]; // _Vincenzo Librandi_, Nov 16 2016
%Y A079727 Cf. A002476.
%Y A079727 Cf. Sum_{k = 0..n} binomial(2*k, k)^m: A006134 (m=1), A115257 (m=2), this sequence (m=3).
%K A079727 nonn,easy
%O A079727 0,2
%A A079727 _Benoit Cloitre_, Feb 17 2003