login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218394 Numbers such that sum(i<=n) binomial(n,i)*binomial(2*n-2*i, n-i) is not divisible by 5. 0
1, 5, 7, 11, 25, 27, 31, 35, 37, 51, 55, 57, 61, 125, 127, 131, 135, 137, 151, 155, 157, 161, 175, 177, 181, 185, 187, 251, 255, 257, 261, 275, 277, 281, 285, 287, 301, 305, 307, 311, 625, 627, 631, 635, 637, 651, 655, 657, 661, 675, 677, 681, 685, 687, 751 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) = A037453(2*n-1) (proved by Schur, see link).

LINKS

Table of n, a(n) for n=1..55.

W. Shur, The last digit of C(2*n,n) and Sigma C(n,i)*C(2*n-2*i,n-i), The Electronic Journal of Combinatorics, #R16, Volume 4, Issue 2 (1997).

FORMULA

a(n)=2*n - 1 + 2*sum{i=1,n} 5^(i-1)*floor((2*n-1)/3^i).

PROG

(PARI) a(nb) = {for (n=1, nb, if (sum(i=1, n, binomial(n, i)*binomial(2*n-2*i, n-i)) % 5 != 0, print1(n, ", ")); ); }

(PARI) a(n) = {2*n-1+2*sum(i=1, n, 5^(i-1)*floor((2*n-1)/3^i))}

CROSSREFS

Cf. A037453.

Sequence in context: A075705 A339096 A249735 * A067289 A036491 A036490

Adjacent sequences:  A218391 A218392 A218393 * A218395 A218396 A218397

KEYWORD

nonn

AUTHOR

Michel Marcus, Oct 28 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 03:22 EST 2020. Contains 338865 sequences. (Running on oeis4.)