login
Position of the n largest occurrences of a shortest addition chain of length n in A003313, written as a triangle.
0

%I #13 Dec 23 2015 02:55:33

%S 2,4,3,8,6,5,16,12,10,9,32,24,20,18,17,64,48,40,36,34,33,128,96,80,72,

%T 68,66,65,256,192,160,144,136,132,130,129,512,384,320,288,272,264,260,

%U 258,257

%N Position of the n largest occurrences of a shortest addition chain of length n in A003313, written as a triangle.

%C The terms are given with latest occurrence first, which corresponds to the addition chain of length n for the number 2^n.

%e Triangle of the n latest occurrences:

%e 2

%e 4 3

%e 8 6 5

%e 16 12 10 9

%e 32 24 20 18 17

%e 64 48 40 36 34 33

%e 128 96 80 72 68 66 65

%e 256 192 160 144 136 132 130 129

%e 512 384 320 288 272 264 260 258 257

%Y Cf. A003313.

%K nonn,tabl,easy

%O 1,1

%A _Hugo Pfoertner_, Dec 17 2015