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-4 of 4 results.

A207666 Least number k = k(m) for m = A207017(n).

Original entry on oeis.org

2, 2, 3, 2, 2, 2, 4, 3, 3, 2, 3, 2, 2, 2, 5, 4, 3, 3, 4, 3, 2, 4, 3, 3, 2, 3, 6, 2, 2, 2, 3, 5, 4, 4, 3, 4, 3, 3, 3, 4, 2, 5, 4, 3, 3, 2, 3, 4, 3, 3, 2, 7, 3, 2, 2, 6, 3, 2, 6, 7
Offset: 1

Views

Author

Vladimir Shevelev, Feb 19 2012

Keywords

Comments

Or a(n) is smallest H-divisor of A207017(n).

Crossrefs

Cf. A207017.

A207668 Number of suitable numbers k(m) for m = A207017(n).

Original entry on oeis.org

2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1
Offset: 1

Views

Author

Vladimir Shevelev, Feb 19 2012

Keywords

Comments

Or a(n) is the number of proper H-divisors > 1 of A207017(n).

Crossrefs

Cf. A207017, A207666.

A207460 Let a(1) = 4. For n > 1, a(n) is the least number greater than a(n-1) such that the Hamming distance D(a(n-1),a(n)) = 4.

Original entry on oeis.org

4, 11, 16, 31, 35, 44, 49, 62, 70, 73, 82, 93, 97, 110, 112, 127, 143, 145, 158, 162, 173, 176, 191, 199, 200, 211, 220, 224, 239, 241, 254, 286, 290, 301, 304, 319, 327, 328, 339, 348, 352, 367, 369, 382, 398, 400, 415, 419
Offset: 1

Views

Author

Vladimir Shevelev, Feb 18 2012

Keywords

Comments

All terms are odious (A000069).

Links

Crossrefs

Cf. A000225, A205509, A205510, A205511, A205302, 205649, A205533, A122565, A206852, A206853, A206960, A207016, A207017.

Programs

  • Mathematica
    nxt[n_]:=Module[{k=n+1},While[HammingDistance[PadLeft[IntegerDigits[ n,2],IntegerLength[ k,2]],IntegerDigits[k,2]]!=4,k++];k]; NestList[ nxt,4,50] (* Harvey P. Dale, Nov 07 2020 *)

A207472 Let a(1) = 5. For n > 1, a(n) is the least number greater than a(n-1) such that the Hamming distance D(a(n-1),a(n)) = 5.

Original entry on oeis.org

5, 26, 33, 62, 66, 93, 96, 127, 135, 152, 163, 188, 192, 223, 225, 254, 270, 273, 294, 313, 320, 351, 353, 382, 390, 409, 418, 445, 449, 478, 480, 511, 543, 545, 574, 578, 605, 608, 639, 647, 664, 675, 700, 704, 735, 737, 766, 782, 785, 806, 825, 832, 863, 865
Offset: 1

Views

Author

Vladimir Shevelev, Feb 18 2012

Keywords

Comments

Odious and evil terms are alternating (cf. A000069, A001969).

Links

Crossrefs

Cf. A000069, A000225, A001969, A205509, A205510, A205511, A205302, A205649, A205533, A122565, A206852, A206853, A206960, A207016, A207017.

Programs

  • Mathematica
    a[1] = 5; a[n_] := a[n] = Module[{k = a[n - 1], m = a[n-1] + 1}, While[DigitCount[BitXor[k, m], 2, 1] != 5, m++]; m]; Array[a, 100] (* Amiram Eldar, Aug 06 2023 *)
Showing 1-4 of 4 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.