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.

A230875 a(1)=0; thereafter a(n) = 2^a(ceiling(n/2)).

Original entry on oeis.org

0, 1, 2, 2, 4, 4, 4, 4, 16, 16, 16, 16, 16, 16, 16, 16, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536
Offset: 1

Views

Author

N. J. A. Sloane, Nov 07 2013

Keywords

Comments

a(33) through a(64) are 2^65536.

Crossrefs

Formula

For n>2, a(n) = a tower of 2's of height ceiling(log_2(n))-1. E.g. a(17) = 2^2^2^2.