This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098534 Mod 3 analog of Stern's diatomic series. 1

%I

%S 0,1,1,2,3,2,2,4,3,4,7,5,6,5,5,4,6,4,4,8,6,8,8,7,6,10,7,8,15,11,14,10,

%T 12,10,13,11,12,11,11,10,12,10,10,11,9,8,14,10,12,10,10,8,12,8,8,16,

%U 12,16,13,14,12,17,14,16,18,16,16,17,15,14,17,13,12,22,16,20,18,17,14,22

%N Mod 3 analog of Stern's diatomic series.

%C Essentially diagonal sums of Pascal's triangle modulo 3.

%H G. C. Greubel, <a href="/A098534/b098534.txt">Table of n, a(n) for n = 0..10000</a>

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

%t Table[Sum[Mod[Binomial[n - k - 1, k], 3], {k, 0, Floor[(n - 1)/2]}], {n, 0, 100}] (* _G. C. Greubel_, Jan 17 2018 *)

%o (PARI) for(n=0,100, print1(sum(k=0,floor((n-1)/2), lift(Mod(binomial(n-k-1,k),3))), ", ")) \\ _G. C. Greubel_, Jan 17 2018

%o (MAGMA) [0] cat [(&+[Binomial(n-k-1,k) mod 3: k in [0..Floor((n-1)/2)]]): n in [1..100]]; // _G. C. Greubel_, Jan 17 2018

%Y Cf. A002487, A051638.

%K easy,nonn

%O 0,4

%A _Paul Barry_, Sep 13 2004

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 December 12 07:00 EST 2019. Contains 329948 sequences. (Running on oeis4.)