A174523 Triangle T(n,1) = A117989(n+1) in the first column and recursively T(n,k) = 2*T(n-1,k-1).

1, 1, 2, 3, 2, 4, 3, 6, 4, 8, 7, 6, 12, 8, 16, 8, 14, 12, 24, 16, 32, 14, 16, 28, 24, 48, 32, 64, 18, 28, 32, 56, 48, 96, 64, 128, 28, 36, 56, 64, 112, 96, 192, 128, 256, 35, 56, 72, 112, 128, 224, 192, 384, 256, 512, 53, 70, 112, 144, 224, 256

Offset: 1

Author

Alford Arnold, Mar 30 2010

Keywords

• easy
• nonn
• tabl

Examples

			1;
1,2;
3,2,4;
3,6,4,8;
7,6,12,8,16;
8,14,12,24,16,32;
14,16,28,24,48,32,64;
18,28,32,56,48,96,64,128;
28,36,56,64,112,96,192,128,256;
35,56,72,112,128,224,192,384,256,512;
		

Crossrefs

Cf. A056823 (row sums).

Programs

Maple

A174523 := proc(n,k)
    option remember;
    if k = 1 then
        A117989(n+1) ;
    elif k > n then
        0;
    else
        2*procname(n-1,k-1) ;
    end if;
end proc: # R. J. Mathar, May 19 2016

Extensions

Edited by R. J. Mathar, May 17 2016