login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A278415 a(n) = Sum_{k=0..n} binomial(n, 2k)*binomial(n-k, k)*(-1)^k. 2
1, 1, 0, -5, -16, -24, 15, 197, 576, 724, -1200, -8832, -22801, -21293, 76440, 408795, 922368, 499104, -4446588, -19025060, -37012416, -1673992, 245604832, 880263936, 1441226991, -908700649, -13088509200, -40222012703, -52991533744, 88167061704, 678172355415, 1805175708261, 1747974632448, -6237554623536, -34300087628480 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

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.

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.

See also A275027 and A278405 for similar conjectures.

LINKS

Zhi-Wei Sun, Table of n, a(n) for n = 0..400

Zhi-Wei Sun, Supercongruences involving Lucas sequences, arXiv:1610.03384 [math.NT], 2016.

EXAMPLE

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.

MATHEMATICA

a[n_]:=Sum[Binomial[n, 2k]Binomial[n-k, k](-1)^k, {k, 0, n}]

Table[a[n], {n, 0, 34}]

CROSSREFS

Cf. A208425, A244973, A277640, A275027, A278405.

Sequence in context: A029450 A225539 A299124 * A063243 A063232 A087747

Adjacent sequences: A278412 A278413 A278414 * A278416 A278417 A278418

KEYWORD

sign

AUTHOR

Zhi-Wei Sun, Nov 21 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 16:09 EST 2022. Contains 358431 sequences. (Running on oeis4.)