Search: id:A102363
Results 1-1 of 1 results found.

%I A102363
%S A102363 1,2,3,4,5,7,8,9,12,15,16,17,21,27,31,32,33,38,48,58,63,64,65,71,86,106,
%T A102363 121,127,128,129,136,157,192,227,248,255,256,257,265,293,349,419,475,
%U A102363 503,511,512,513,522,558,642,768,894,978,1014,1023,1024,1025,1035,1080
%N A102363 Triangle read by rows, constructed by a Pascal-like rule with left edge 
               = 2^k, right edge = 2^(k+1)-1 (k>=0).
%C A102363 First column right of center divided by 3 equals powers of 4.
%C A102363 Right of left edge, sums of rows are divisible by 3
%C A102363 Apparently the number of terms per row plus the number of numbers in 
               natural order skipped per row equals a power of 2. [From David G. 
               Williams (davidwilliams(AT)paxway.com), Jun 27 2009]
%e A102363 ....................................1
%e A102363 ..................................2...3
%e A102363 ...............................4....5...7
%e A102363 .............................8....9...12..15
%e A102363 ...........................16..17..21..27..31
%e A102363 .........................32..33..38..48..58..63
%e A102363 .....................64...65..71..86..106.121.127
%e A102363 ..................128.129..136..157.192.227.248.255
%e A102363 ...............256..257..265..293..349.419.475.503.511
%p A102363 T:=proc(n,k) if k=0 then 2^n elif k=n then 2^(n+1)-1 else T(n-1,k)+T(n-1,
               k-1) fi end: for n from 0 to 10 do seq(T(n,k),k=0..n) od; # yields 
               sequence in triangular form (Deutsch)
%Y A102363 Cf. A000079.
%Y A102363 Sequence in context: A086753 A160519 A051204 this_sequence A155900 A107684 
               A111796
%Y A102363 Adjacent sequences: A102360 A102361 A102362 this_sequence A102364 A102365 
               A102366
%K A102363 nonn,tabl,easy
%O A102363 0,2
%A A102363 David G. Williams (davwill24(AT)aol.com), Mar 15 2005, Oct 05 2007
%E A102363 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 26 2005

Search completed in 0.002 seconds