login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A264802
Position of the n largest occurrences of a shortest addition chain of length n in A003313, written as a triangle.
0
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, 68, 66, 65, 256, 192, 160, 144, 136, 132, 130, 129, 512, 384, 320, 288, 272, 264, 260, 258, 257
OFFSET
1,1
COMMENTS
The terms are given with latest occurrence first, which corresponds to the addition chain of length n for the number 2^n.
EXAMPLE
Triangle of the n latest occurrences:
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 68 66 65
256 192 160 144 136 132 130 129
512 384 320 288 272 264 260 258 257
CROSSREFS
Cf. A003313.
Sequence in context: A333485 A246166 A334437 * A243493 A127301 A209636
KEYWORD
nonn,tabl,easy
AUTHOR
Hugo Pfoertner, Dec 17 2015
STATUS
approved