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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A335965 a(n) = number of odd numbers in the n-th row of the Narayana triangle A001263. 0
1, 2, 3, 2, 2, 4, 7, 2, 2, 4, 6, 4, 4, 8, 15, 2, 2, 4, 6, 4, 4, 8, 14, 4, 4, 8, 12, 8, 8, 16, 31, 2, 2, 4, 6, 4, 4, 8, 14, 4, 4, 8, 12, 8, 8, 16, 30, 4, 4, 8, 12, 8, 8, 16, 28, 8, 8, 16, 24, 16, 16, 32, 63, 2, 2, 4, 6, 4, 4, 8, 14, 4, 4, 8, 12, 8, 8, 16, 30, 4, 4, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n)=n iff n=2^k-1 or n=2.
LINKS
S.P. Eu, S.C. Liu, Y.N. Yeh, On the Congruences of Some Combinatorial Numbers, Studies in Applied Mathematics, 116(2006), 135-144.
EXAMPLE
The Narayana numbers are binomial(n-1, k-1)*binomial(n, k-1)/k. a(4)=4 since for n=4 there are two odd numbers among 1,6,6,1.
MATHEMATICA
a[n_] := Count[Table[Binomial[n - 1, k - 1] Binomial[n, k - 1]/k, {k, 1, n}], _?OddQ]; Array[a, 100] (* Amiram Eldar, Jul 02 2020 *)
PROG
(PARI) a(n) = sum(k=1, n, binomial(n-1, k-1)*binomial(n, k-1)/k % 2); \\ Michel Marcus, Jul 02 2020
CROSSREFS
Cf. A001263.
Sequence in context: A163873 A309563 A292588 * A225176 A349271 A349387
KEYWORD
nonn
AUTHOR
Sen-Peng Eu, Jul 01 2020
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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)