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.

A175919 Convert n to binary. XOR each respective digit of binary n and binary A030101(n), where A030101(n) is the reversal of the order of the digits in the binary representation of n (given in decimal). a(n) is the decimal value of the result.

Original entry on oeis.org

0, 0, 3, 0, 5, 0, 5, 0, 9, 0, 15, 6, 15, 6, 9, 0, 17, 0, 27, 10, 17, 0, 27, 10, 27, 10, 17, 0, 27, 10, 17, 0, 33, 0, 51, 18, 45, 12, 63, 30, 45, 12, 63, 30, 33, 0, 51, 18, 51, 18, 33, 0, 63, 30, 45, 12, 63, 30, 45, 12, 51, 18, 33, 0, 65, 0, 99, 34, 85, 20, 119, 54, 65, 0, 99, 34, 85, 20, 119
Offset: 0

Views

Author

Dylan Hamilton, Oct 15 2010

Keywords

Comments

Description format taken from Leroy Quet's OR and AND gate sequences for consistency.

Crossrefs

Or A175298 and And A175297 gate sequences. The rest of the equivalent sequences for other gates are adjacent.

Programs

  • Mathematica
    Table[f = IntegerDigits[x, 2]; f = f + Reverse[f]; FromDigits[ Table[If[OddQ[f[[r]]], 1, 0], {r, 1, Length[f]}], 2], {x, STARTPOINT,ENDPOINT}]

Formula

a(n) = A003987(n, A030101(n)).

A256754 a(n) = bitwise AND of n and the reverse of n.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 4, 13, 8, 3, 16, 1, 16, 19, 0, 4, 22, 0, 8, 16, 26, 8, 16, 28, 2, 13, 0, 33, 34, 33, 36, 1, 2, 5, 0, 8, 8, 34, 44, 36, 0, 10, 16, 16, 0, 3, 16, 33, 36, 55, 0, 9, 16, 27, 4, 16, 26, 36, 0, 0, 66, 64, 68, 64, 6, 1, 8, 1, 10
Offset: 0

Views

Author

Alois P. Heinz, Apr 09 2015

Keywords

Crossrefs

Programs

  • Maple
    a:= n-> Bits[And](n, (s-> parse(cat(s[-i]$i=1..length(s))))(""||n)):
    seq(a(n), n=0..80);
  • Mathematica
    Table[BitAnd[n,FromDigits[Reverse[IntegerDigits[n]]]],{n,0,74}] (* Ivan N. Ianakiev, Apr 10 2015 *)
  • PARI
    a(n) = bitand(n, subst(Polrev(digits(n)), x, 10)); \\ Michel Marcus, Apr 10 2015

Formula

a(n) = A004198(n,A004086(n)).

A256755 a(n) = bitwise OR of n and the reverse of n.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 11, 29, 31, 47, 63, 61, 87, 83, 91, 22, 29, 22, 55, 58, 61, 62, 91, 94, 93, 31, 31, 55, 33, 43, 55, 63, 109, 119, 127, 44, 47, 58, 43, 44, 63, 110, 111, 116, 127, 55, 63, 61, 55, 63, 55, 121, 123, 127, 127, 62, 61, 62, 63, 110
Offset: 0

Views

Author

Alois P. Heinz, Apr 09 2015

Keywords

Crossrefs

Programs

  • Maple
    a:= n-> Bits[Or](n, (s-> parse(cat(s[-i]$i=1..length(s))))(""||n)):
    seq(a(n), n=0..80);
  • Mathematica
    Table[BitOr[n,FromDigits[Reverse[IntegerDigits[n]]]],{n,0,64}] (* Ivan N. Ianakiev, Apr 10 2015 *)
  • PARI
    a(n) = bitor(n, subst(Polrev(digits(n)), x, 10)); \\ Michel Marcus, Apr 10 2015

Formula

a(n) = A003986(n,A004086(n)).
Showing 1-3 of 3 results.