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.

A256217 a(n) = A000011(n) - A256216(n).

Original entry on oeis.org

1, 2, 2, 4, 4, 7, 8, 14, 16, 26, 32, 52, 64, 101, 128, 202, 256, 399, 512, 796, 1024, 1583, 2048, 3162, 4096, 6302, 8192, 12586, 16384, 25124, 32768, 50186, 65536, 100232, 131072, 200266, 262144, 400115, 524288, 799568, 1048576, 1597834, 2097152, 3193438, 4194304, 6382637, 8388608, 12757770, 16777216, 25501370
Offset: 1

Views

Author

N. J. A. Sloane, Mar 26 2015

Keywords

Comments

Counts contiguously substituted cycloalkane polyols (CSCPs).
Consider a bracelet of n beads, each colored blue on one side and red on the other -- each bead changes color when the bracelet is turned over. Reversal is then the same as swapping the colors. a(n) is the number of colorings that are invariant under reversal, up to rotation and turning over. - Ed Wynn, May 22 2021

Examples

			The a(7) = 8 bracelets are rrrrrrr, rrrrrrb, rrrrrbb, rrrrbbb, rrrrbrb, rrrbrrb, rrbbrrb, rrbrbrb. - _Ed Wynn_, May 22 2021
a(12) = A056503(12) + 1. The extra bracelet is rrrbrrbbbrbb. - _Andrew Howroyd_, Jun 25 2021
		

Crossrefs

The 8 sequences in Table 8 of Fujita (2017) are A053656, A000011, A256216, A256217, A123045, A283846, A283847, A283848.

Formula

a(n) = A056503(n) for odd n. - Andrew Howroyd, Jun 14 2021