|
|
A065031
|
|
In the decimal expansion of n, replace each odd digit with 1 and each even digit with 2.
|
|
6
|
|
|
2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 22, 21, 22, 21, 22, 21, 22, 21, 22, 21, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 22, 21, 22, 21, 22, 21, 22, 21, 22, 21, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 22, 21, 22, 21, 22, 21, 22, 21, 22, 21
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(123)=121 because 1 and 3 are odd and 2 is even.
|
|
MATHEMATICA
|
Table[FromDigits[If[OddQ[#], 1, 2]&/@IntegerDigits[n]], {n, 0, 120}] (* Harvey P. Dale, Jun 08 2014 *)
|
|
PROG
|
(Haskell)
a065031 n = f n where
f x | x < 10 = 2 - x `mod` 2
| otherwise = 10 * (f x') + 2 - m `mod` 2
where (x', m) = divMod x 10
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|