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.

A274069 a(n) is the concatenation of a(n-1) and the Hamming distance between a(n-1) and its reverse (i.e., the minimum number of bitflips needed to make them identical). Sequence written in binary.

Table of values

n a(n)
1 1
2 10
3 1010
4 1010100
5 101010010
6 101010010110
7 101010010110100
8 101010010110100100
9 1010100101101001001000
10 10101001011010010010001110
11 101010010110100100100011101100
12 10101001011010010010001110110010100
13 101010010110100100100011101100101001100
14 10101001011010010010001110110010100110011000
15 10101001011010010010001110110010100110011000100000

List of values

[1, 10, 1010, 1010100, 101010010, 101010010110, 101010010110100, 101010010110100100, 1010100101101001001000, 10101001011010010010001110, 101010010110100100100011101100, 10101001011010010010001110110010100, 101010010110100100100011101100101001100, 10101001011010010010001110110010100110011000, 10101001011010010010001110110010100110011000100000]

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

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