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.

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

This page as a plain text file.
%I A256755 #17 Mar 19 2019 17:21:06
%S A256755 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,
%T A256755 62,91,94,93,31,31,55,33,43,55,63,109,119,127,44,47,58,43,44,63,110,
%U A256755 111,116,127,55,63,61,55,63,55,121,123,127,127,62,61,62,63,110
%N A256755 a(n) = bitwise OR of n and the reverse of n.
%H A256755 Alois P. Heinz, <a href="/A256755/b256755.txt">Table of n, a(n) for n = 0..10000</a>
%H A256755 Wikipedia, <a href="https://en.wikipedia.org/wiki/Bitwise operation">Bitwise operation</a>
%F A256755 a(n) = A003986(n,A004086(n)).
%p A256755 a:= n-> Bits[Or](n, (s-> parse(cat(s[-i]$i=1..length(s))))(""||n)):
%p A256755 seq(a(n), n=0..80);
%t A256755 Table[BitOr[n,FromDigits[Reverse[IntegerDigits[n]]]],{n,0,64}] (* _Ivan N. Ianakiev_, Apr 10 2015 *)
%o A256755 (PARI) a(n) = bitor(n, subst(Polrev(digits(n)), x, 10)); \\ _Michel Marcus_, Apr 10 2015
%Y A256755 Cf. A003986, A004086, A055483, A056964, A056965, A061205, A068634, A256754, A256756.
%K A256755 nonn,base,look,easy
%O A256755 0,3
%A A256755 _Alois P. Heinz_, Apr 09 2015