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!)
A059781 Triangle T(n,k) giving exponent of power of 2 dividing entry (n,k) of trinomial triangle A027907. 0

%I #9 Dec 22 2014 02:01:17

%S 0,0,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,2,1,4,0,4,1,2,0,0,0,0,1,0,0,0,1,0,

%T 0,0,0,1,0,1,1,1,0,1,1,1,0,1,0,0,0,2,0,0,1,0,0,0,1,0,0,2,0,0,0,3,2,4,

%U 1,3,4,3,0,3,4,3,1,4,2,3,0,0,0,0,2,1,1,1,8,0,0,0,8,1,1,1,2,0,0,0,0,1,0,1,0

%N Triangle T(n,k) giving exponent of power of 2 dividing entry (n,k) of trinomial triangle A027907.

%D B. A. Bondarenko, Generalized Pascal Triangles and Pyramids (in Russian), FAN, Tashkent, 1990, ISBN 5-648-00738-8. English translation published by Fibonacci Association, Santa Clara Univ., Santa Clara, CA, 1993; see p. 117.

%e 0; 0,0,0; 0,1,0,1,0; ...

%p with(numtheory): T := proc(i,j) option remember: if i >= 0 and j=0 then RETURN(1) fi: if i >= 0 and j=2*i then RETURN(1) fi: if i >= 1 and j=1 then RETURN(i) fi: if i >= 1 and j=2*i-1 then RETURN(i) fi: T(i-1,j-2)+T(i-1,j-1)+T(i-1,j): end: for i from 0 to 20 do for j from 0 to 2*i do if T(i,j) mod 2 = 1 then printf(`%d,`,0) else printf(`%d,`, ifactors(T(i,j))[2,1,2] ) fi: od:od: # _James A. Sellers_, Feb 22 2001

%K nonn,easy,tabf

%O 0,18

%A _N. J. A. Sloane_, Feb 22 2001

%E More terms from _James A. Sellers_, Feb 22 2001

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 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)