cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Hugo Pfoertner, Dec 17 2015

Keywords

Comments

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

Examples

			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.