login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; table; graph; refs; listen; history; text; internal format)
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.

LINKS

Table of n, a(n) for n=1..45.

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

Adjacent sequences:  A264799 A264800 A264801 * A264803 A264804 A264805

KEYWORD

nonn,tabl,easy

AUTHOR

Hugo Pfoertner, Dec 17 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 12:04 EDT 2021. Contains 345025 sequences. (Running on oeis4.)