|
|
A190944
|
|
Multiples of 3 written in base 2.
|
|
3
|
|
|
0, 11, 110, 1001, 1100, 1111, 10010, 10101, 11000, 11011, 11110, 100001, 100100, 100111, 101010, 101101, 110000, 110011, 110110, 111001, 111100, 111111, 1000010, 1000101, 1001000, 1001011, 1001110, 1010001, 1010100, 1010111, 1011010, 1011101, 1100000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
A190944 := proc(n) local b: if(n=0)then return 0: fi: b:=convert(3*n, base, 2); return op(convert(b, base, 10, 10^nops(b))): end: seq(A190944(n), n=0..40); # Nathaniel Johnston, May 25 2011
|
|
MATHEMATICA
|
|
|
PROG
|
(Magma) [Seqint(Intseq(n, 2)): n in [0..90 by 3]]; // Bruno Berselli, May 25 2011
(Haskell)
(PARI) a(n) = fromdigits(binary(3*n), 10); \\ Michel Marcus, Oct 25 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|