|
%I #16 Mar 26 2017 12:04:39
%S 1,3,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,
%T 131072,262144,524288,1048576,2097152,4194304,8388608,16777216,
%U 33554432,67108864,134217728,268435456,536870912,1073741824,2147483648
%N Consider the following triangle in which the n-th row contains n distinct numbers whose product is the smallest and has the least possible number of divisors. 1 is a member of only the first row. Sequence contains the final term of the rows (the leading diagonal).
%C N points are chosen on a circle to get n arcs of different lengths. Then a(n-1) counts - _Anton Zakharov_, Dec 14 2016
%F For n>2, a(n)=2^n. - _Ray Chandler_, Aug 21 2003
%F Row sums of triangle A132309. - _Gary W. Adamson_, Aug 18 2007
%e Triangle begins
%e 1
%e 2 3
%e 2 4 8
%e 2 4 8 16
%e 2 4 8 16 32
%t Table[2^(n + 1) - Boole[n < 2], {n, 0, 30}] (* _Michael De Vlieger_, Mar 15 2017 *)
%Y Cf. A132309.
%K nonn
%O 0,2
%A _Amarnath Murthy_, Nov 10 2002
%E Corrected and extended by _Ray Chandler_, Aug 21 2003
|
