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.

A243036 Number of entries of length n in A240602.

Original entry on oeis.org

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

Views

Author

Lior Manor, May 29 2014

Keywords

Comments

For n>0, a(2^n) = 1.
For any base b, a(1) = b, a(2) = b-1, a(3) = b*(b-1), for m>1, a(2m) = a(m), a(2m+1) = b*a(m).
For any base b, a(n) = (b-1)*b^(A000120(n)-1).
Essentially the same as A048896. - R. J. Mathar, Jun 27 2014

Crossrefs

Formula

a(1) = 2, a(2) = 1, a(3) = 2, For m>1, a(2m) = a(m), a(2m+1) = 2*a(m).
a(n) = 2^(A000120(n)-1).