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.

A337131 Row lengths of irregular triangle A335967.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 1, 4, 2, 1, 2, 1, 1, 1, 1, 2, 1, 4, 8, 2, 2, 1, 1, 4, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 4, 1, 1, 4, 4, 16, 8, 2, 4, 2, 2, 1, 1, 2, 1, 4, 8, 2, 2, 1, 1, 4, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 4, 1, 1, 2, 2, 8, 4, 1, 2, 1, 1, 4, 4, 8, 4, 16, 32, 8
Offset: 1

Views

Author

Rémy Sigrist, Sep 14 2020

Keywords

Comments

All terms are powers of 2.

Examples

			For n = 13, the binary representation of 13 is "1101", so we consider the tilings of a size 4 staircase polyomino whose base has the following shape:
      .....
      .   .
      .   .....
      .       .
      +---+   .....
      |   |       .
      |   +---+---+---+
      | 1   1 | 0 | 1 |
      +-------+---+---+
There are two possible penultimate rows:
      .....              .....
      .   .              .   .
      .   .....          .   .....
      .   |   .          .       .
      +---+   +---+      +---+---+---+
      | 1 | 0   0 |      | 1 | 0 | 1 |
      |   +---+---+---+  |   +---+---+---+
      |       |   |   |  |       |   |   |
      +-------+---+---+, +-------+---+---+
so a(13) = 2.
		

Crossrefs

Programs

  • PARI
    \\ See Links section.

Formula

a(2^k-1) = 1 for any k >= 0.
a(2^k) = 1 for any k >= 0.
a(A000975(k)) = 2^(k-2) for any k >= 2.