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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329720 a(n) = Sum_{k=0..n} ((binomial(n-k,6k)*binomial(n,k)) mod 2). 1
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 3, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 4, 6, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

COMMENTS

Run length transform of Narayana's cows sequence (A000930).

LINKS

Chai Wah Wu, Table of n, a(n) for n = 0..10000

Chai Wah Wu, Sums of products of binomial coefficients mod 2 and run length transforms of sequences, arXiv:1610.06166 [math.CO], 2016.

PROG

(PARI) a(n) = sum(k=0, n, (binomial(n-k, 6*k)*binomial(n, k)) % 2); \\ Michel Marcus, Feb 08 2020

CROSSREFS

Cf. A000930.

Sequence in context: A242217 A306734 A124060 * A140194 A159923 A287957

Adjacent sequences:  A329717 A329718 A329719 * A329721 A329722 A329723

KEYWORD

nonn

AUTHOR

Chai Wah Wu, Nov 19 2019

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 June 22 04:06 EDT 2021. Contains 345367 sequences. (Running on oeis4.)