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.

A383182 a(n) = 2^n - A129629(n+1).

Original entry on oeis.org

0, 1, 1, 1, 2, 1, 1, 5, 1, 1, 9, 1, 4, 16, 1, 1, 33, 11, 1, 65, 1, 1, 142, 1, 8, 257, 1, 35, 513, 1, 1, 1038, 67, 1, 2049, 1, 1, 4220, 39, 1, 8192, 1, 259, 16385, 1, 71, 32769, 515, 1, 65550, 1, 1, 132211, 1, 1, 262145, 1, 2051, 524302, 263, 32, 1048577, 4096, 1, 2097153, 1, 519, 4202480, 1, 1
Offset: 0

Views

Author

M. F. Hasler, May 27 2025

Keywords

Comments

We observe that 2^(n-1) - A129629(n) often equals 1, and otherwise this difference is often the sum of only one or two distinct powers of two.

Crossrefs

Cf. A129629.

Programs