A129629 -id:A129629 - cp's OEIS frontend

Showing 1-2 of 2 results.

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

M. F. Hasler, May 27 2025

nonn

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.

PARI
```
A383182(n)=2^n-A129629(n+1)
```

A011947 Number of Barlow packings with group P63/mmc(O) that repeat after 4n+2 layers.

Original entry on oeis.org

1, 1, 3, 7, 14, 31, 63, 123, 255, 511, 1015, 2047, 4092

Offset: 0

N. J. A. Sloane

Apparently identical to A129629.

T. J. McLarnan, The numbers of polytypes ..., Zeits. Krist. 155, 269-291 (1981).

Conjecture: a(n) = A045683(2n+1). - R. J. Mathar, Apr 15 2024

Showing 1-2 of 2 results.