This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113046 Diagonal sums of number triangle binomial(n, floor((n-k)/2)) mod 3. 2

%I

%S 1,1,3,1,1,3,5,5,6,3,3,3,3,3,3,1,1,9,11,11,12,5,5,15,16,10,12,6,6,9,9,

%T 6,6,3,3,9,9,9,9,3,3,9,9,6,6,3,3,3,3,3,3,1,1,27,29,29,30,11,11,33,34,

%U 22,24,12,12,15,15,12,12,5,5,45,46,28,30,16,16,30,32,23,24,12,12,18,18,12

%N Diagonal sums of number triangle binomial(n, floor((n-k)/2)) mod 3.

%C Diagonal sums of A113045.

%H Antti Karttunen, <a href="/A113046/b113046.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = Sum_{k=0..floor(n/2)} binomial(n-k, floor((n-2k)/2)) mod 3.

%p A113046:=n->add(binomial(n-k, floor((n-2*k)/2)) mod 3, k=0..floor(n/2)): seq(A113046(n), n=0..150); # _Wesley Ivan Hurt_, Jul 25 2017

%o (PARI) A113046(n) = sum(k=0,n\2,binomial(n-k,((n-(2*k))\2))%3); \\ _Antti Karttunen_, Jul 24 2017

%Y Cf. A113045.

%K easy,nonn

%O 0,3

%A _Paul Barry_, Oct 11 2005

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.

Last modified July 17 14:44 EDT 2019. Contains 325106 sequences. (Running on oeis4.)