cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A179524 a(n) = Sum_{k=0..n} (-4)^k*binomial(n,k)^2*binomial(n-k,k)^2.

Original entry on oeis.org

1, 1, -15, -143, 1, 12801, 100401, -555855, -16006143, -69903359, 1371541105, 20881151985, 5878439425, -2725373454335, -25310084063055, 145439041081137, 4851621446905857, 23952290336559105, -470461357757965071, -7793050905481342863, -4149447893184517119
Offset: 0

Views

Author

Zhi-Wei Sun, Jul 17 2010

Keywords

Comments

On July 1, 2010 Zhi-Wei Sun introduced this sequence and made the following conjecture: If p is a prime with p=1,9 (mod 20) and p=x^2+5y^2 with x,y integers, then sum_{k=0}^{p-1}a(k)=4x^2-2p (mod p^2); if p is a prime with p=3,7 (mod 20) and 2p=x^2+5y^2 with x,y integers, then sum_{k=0}^{p-1}a(k)=2x^2-2p (mod p^2); if p is a prime with p=11,13,17,19 (mod 20), then sum_{k=0}^{p-1}w_k=0 (mod p^2). He also conjectured that sum_{k=0}^{n-1}(20k+17)w_k=0 (mod n) for all n=1,2,3,... and that sum_{k=0}^{p-1}(20k+17)w_k=p(10(-1/p)+7) (mod p^2) for any odd prime p. Sun also formulated similar conjectures for some sequences similar to a(n).

Examples

			For n=3 we have a(3)=1-4*3^2*2^2=-143.
		

Crossrefs

Programs

  • Mathematica
    W[n_]:=Sum[(-4)^k*Binomial[n,k]^2*Binomial[n-k,k]^2,{k,0,n}] Table[W[n],{n,0,50}]

Formula

a(n) = Sum_{k=0..[n/2]} (-4)^k*binomial(n,2k)^2*binomial(2k,k)^2.

A372525 Composite numbers k that divide A000296(k) + (-1)^k.

Original entry on oeis.org

6, 1991, 5459, 17391
Offset: 1

Views

Author

Amiram Eldar, Jun 07 2024

Keywords

Comments

Equivalently, composite numbers k such that Sum_{i=1..k-1} (-1)^i * Bell(i) == 1 (mod k), where Bell(i) = A000110(i).
The congruence holds for all the primes. This is a special case of Sun and Zagier's (2011) Theorem 1.1, when m = 1.
a(5) > 56000, if it exists.

Crossrefs

Programs

  • Mathematica
    f[k_] := f[k] = Sum[Binomial[k-1, i] * f[k-i-1], {i, 1, k-1}]; f[0] = 1; Select[Range[2000], CompositeQ[#] && Divisible[f[#] + (-1)^# , #] &]
Showing 1-2 of 2 results.