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.

Showing 1-3 of 3 results.

A080316 a(n) = A080315(n) - 2^A000523(A080315(n)), i.e., the terms of A080315 without their most significant bit.

Original entry on oeis.org

0, 12, 204, 240, 3276, 3312, 4032, 3852, 3888, 52428, 52464, 53184, 53004, 53040, 64524, 64560, 64704, 61644, 61680, 65280, 62400, 62220, 62256, 838860, 838896, 839616, 839436, 839472, 850956, 850992, 851136, 848076, 848112, 851712, 848832
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Crossrefs

Same sequence in binary: A080317.

A080315 a(n) = A080313(n)/2.

Original entry on oeis.org

1, 28, 460, 496, 7372, 7408, 8128, 7948, 7984, 117964, 118000, 118720, 118540, 118576, 130060, 130096, 130240, 127180, 127216, 130816, 127936, 127756, 127792, 1887436, 1887472, 1888192, 1888012, 1888048, 1899532, 1899568, 1899712
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Crossrefs

Cf. A080316, A080317.

A083933 A063171-encoding of A083923-trees.

Original entry on oeis.org

0, 1100, 11001100, 11110000, 110011001100, 110011110000, 111100001100, 111100110000, 111111000000, 1100110011001100, 1100110011110000, 1100111100001100, 1100111100110000, 1100111111000000, 1111000011001100
Offset: 0

Views

Author

Antti Karttunen, May 13 2003

Keywords

Comments

Subset of totally balanced binary strings (A063171) with only even runs of either bit 0 or 1 occurring.

Crossrefs

Permutation of A080317 from which this differs first time at the sixth term, with a(6)=111100001100, while A080317(6)=111111000000.
Cf. A007088, A063171, A083932, A083923.

Formula

a(n) = A007088(A083932(n)).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.