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.

A115247 2^a(n) divides A001935(n) but 2^(a(n)+1) does not.

Original entry on oeis.org

0, 0, 1, 0, 2, 1, 0, 2, 4, 1, 0, 1, 1, 6, 1, 0, 2, 1, 4, 1, 6, 0, 2, 4, 1, 2, 2, 8, 0, 1, 1, 2, 1, 4, 6, 1, 0, 3, 4, 1, 2, 7, 1, 6, 1, 0, 1, 4, 6, 2, 1, 1, 2, 1, 1, 0, 1, 1, 8, 2, 4, 2, 6, 4, 3, 1, 0, 2, 4, 7, 3, 1, 1, 4, 1, 1, 6, 1, 0, 2, 1, 2, 1, 6, 1, 2, 4, 2, 7, 8, 6, 0, 2, 4, 2, 1, 1, 6, 4, 4
Offset: 0

Views

Author

Christian G. Bower, Jan 17 2006

Keywords

Comments

Almost all members of A001935 are divisible by 2^k for any k, therefore almost all a(n)>k for any k.

Crossrefs

The 0's are in A000217. The 1's are in A115248. Least inverse A115250.