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!)
A261366 a(n) = number of even terms in row n of triangle A261363. 3

%I #5 Aug 16 2015 17:28:54

%S 0,1,1,2,1,4,3,4,1,8,7,8,5,10,7,8,1,16,15,16,13,18,15,16,9,22,19,20,

%T 13,22,15,16,1,32,31,32,29,34,31,32,25,38,35,36,29,38,31,32,17,46,43,

%U 44,37,46,39,40,25,50,43,44,29,46,31,32,1,64,63,64,61

%N a(n) = number of even terms in row n of triangle A261363.

%C For n > 0: a(n) = n + 1 - A001316(n-1).

%H Reinhard Zumkeller, <a href="/A261366/b261366.txt">Table of n, a(n) for n = 0..10000</a>

%o (Haskell)

%o a261366 = sum . map ((1 -) . flip mod 2) . a261363_row

%Y Cf. A261363, A001316.

%K nonn

%O 0,4

%A _Reinhard Zumkeller_, Aug 16 2015

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 March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)