|
|
A036215
|
|
Binary reversal of 3^n.
|
|
4
|
|
|
1, 3, 9, 27, 69, 207, 621, 3345, 4275, 25497, 38247, 229173, 589185, 1669443, 5205897, 14045019, 34319397, 102566511, 307313949, 1843835217, 2312645619, 13776780249, 20417442711, 112792132341, 290155405761, 847524815523, 2611222884297, 7627711248315
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Compute 3^n in binary, reverse the bits, from 0 to the most significant bit of the power.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[FromDigits[Reverse[IntegerDigits[3^n, 2]], 2], {n, 0, 30}] (* Vincenzo Librandi, Sep 09 2013 *)
|
|
PROG
|
(PARI) a(n) = subst(Polrev(binary(3^n)), x, 2); \\ Michel Marcus, Sep 08 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|