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 A278415 #12 Nov 03 2019 16:28:04
%S A278415 1,1,0,-5,-16,-24,15,197,576,724,-1200,-8832,-22801,-21293,76440,
%T A278415 408795,922368,499104,-4446588,-19025060,-37012416,-1673992,245604832,
%U A278415 880263936,1441226991,-908700649,-13088509200,-40222012703,-52991533744,88167061704,678172355415,1805175708261,1747974632448,-6237554623536,-34300087628480
%N A278415 a(n) = Sum_{k=0..n} binomial(n, 2k)*binomial(n-k, k)*(-1)^k.
%C A278415 Conjecture: For any prime p > 3 and positive integer n, the number (a(p*n)-a(n))/(p*n)^2 is always a p-adic integer.
%C A278415 We are able to show that for any prime p > 3 and positive integer n the number (a(p*n)-a(n))/(p^2*n) is always a p-adic integer.
%C A278415 See also A275027 and A278405 for similar conjectures.
%H A278415 Zhi-Wei Sun, <a href="/A278415/b278415.txt">Table of n, a(n) for n = 0..400</a>
%H A278415 Zhi-Wei Sun, <a href="http://arxiv.org/abs/1610.03384">Supercongruences involving Lucas sequences</a>, arXiv:1610.03384 [math.NT], 2016.
%e A278415 a(3) = -5 since a(3) = C(3, 2*0)*C(3-0, 0)(-1)^0 + C(3,2*1)*C(3-1,1)(-1)^1 = 1 - 6 = -5.
%t A278415 a[n_]:=Sum[Binomial[n,2k]Binomial[n-k,k](-1)^k,{k,0,n}]
%t A278415 Table[a[n],{n,0,34}]
%Y A278415 Cf. A208425, A244973, A277640, A275027, A278405.
%K A278415 sign
%O A278415 0,4
%A A278415 _Zhi-Wei Sun_, Nov 21 2016