A352772 a(n) = A109812(n) AND A109812(n+2) (where AND denotes the bitwise AND operator).

0, 2, 0, 1, 8, 0, 2, 0, 2, 8, 16, 12, 0, 6, 0, 1, 16, 1, 4, 3, 32, 17, 32, 5, 32, 13, 0, 6, 0, 2, 9, 2, 1, 2, 1, 8, 5, 64, 19, 64, 3, 4, 3, 12, 64, 36, 80, 0, 24, 0, 1, 2, 1, 2, 33, 2, 4, 2, 4, 34, 65, 48, 72, 48, 66, 48, 70, 8, 3, 8, 3, 12, 128, 28, 128, 11

Offset

1,2

Comments

The binary expansions of two consecutive terms of A109812 have no common 1's, but the binary expansions of two terms at distance 2 can have some common 1's; this sequence gives these common 1's.

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Log-log scatterplot of the first 2^20 terms

Rémy Sigrist, C++ program

Example

For n = 42:
- A109812(42) = 68,
- A109812(44) = 28,
- so a(42) = 68 AND 28 = 4.

Prog

(C++) See Links section.

Crossrefs

Cf. A109812, A352773.

Sequence in context: A199459 A316649 A065329 * A108998 A356265 A309993

Adjacent sequences: A352769 A352770 A352771 * A352773 A352774 A352775

Keyword

nonn,look,base

Author

Rémy Sigrist, Apr 02 2022

Status

approved