# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a185740
Showing 1-1 of 1

%I A185740 #10 Jul 12 2017 03:18:45
%S A185740 1,1,2,1,0,4,1,0,0,8,1,0,0,0,16,1,0,0,0,0,32,1,0,0,0,0,0,64,1,0,0,0,0,
%T A185740 0,0,128,1,0,0,0,0,0,0,0,256,1,0,0,0,0,0,0,0,0,512,1,0,0,0,0,0,0,0,0,
%U A185740 0,1024,1,0,0,0,0,0,0,0,0,0,0,2048,1,0,0,0,0,0,0,0,0,0,0,0,4096,1,0,0,0,0,0,0,0,0,0,0,0,0,8192
%N A185740 Weight array of A185738, by antidiagonals.
%C A185740 This array is a member of a chain. See A185738. A185740 exemplifies the sort of very simple array whose successive accumulation arrays are interesting. The first two accumulation arrays of A185740 are A185738 and A185739.
%H A185740 G. C. Greubel, <a href="/A185740/b185740.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%F A185740 Column 1: 2^n. Row 1: 1,1,1,1,1,1,1,1,1,1,1,... All other terms: 0.
%e A185740 Northwest corner:
%e A185740 1...1...1...1...1...1...1
%e A185740 2...0...0...0...0...0...0
%e A185740 4...0...0...0...0...0...0
%e A185740 8...0...0...0...0...0...0
%t A185740 (See A185738.)
%t A185740 f[n_, k_] := 0; f[n_, 1] := 2^(n - 1); f[1, k_] := 1;
%t A185740 TableForm[Table[f[n, k], {n, 1, 10}, {k, 1, 10}]] (*Array A185740*)
%t A185740 Table[f[n - k + 1, k], {n, 50}, {k, n, 1, -1}] // Flatten (* _G. C. Greubel_, Jul 12 2017 *)
%Y A185740 Cf. A185738.
%K A185740 nonn,tabl
%O A185740 1,3
%A A185740 _Clark Kimberling_, Feb 02 2011

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE