login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A176894
Increase each digit in the binary representation of n by 2.
0
2, 3, 32, 33, 322, 323, 332, 333, 3222, 3223, 3232, 3233, 3322, 3323, 3332, 3333, 32222, 32223, 32232, 32233, 32322, 32323, 32332, 32333, 33222, 33223, 33232, 33233, 33322, 33323, 33332, 33333, 322222, 322223, 322232, 322233, 322322
OFFSET
0,1
COMMENTS
Or: add two times the repunit of matching length to A007088(n).
FORMULA
a(n) = A007088(n)+A002276(A070939(n)).
EXAMPLE
0+2, 1+2, 10+22, 11+22, 100+222, 101+222, 110+222, 111+222, 1000+2222, 1001+2222,...
MATHEMATICA
Table[Sum[Table[((Reverse[IntegerDigits[n, 2]]) /. 0 -> 2) /. 1 -> 3, {n, 0, 50}][[n]][[m]]*10^( m - 1), {m, 1, Length[Table[((Reverse[IntegerDigits[n, 2]]) /. 0 -> 2) /. 1 -> 3, {n, 0, 50}][[n]]]}], {n, 1, 51}]
Table[FromDigits[2 + IntegerDigits[n, 2]], {n, 0, 100}]
CROSSREFS
Sequence in context: A004843 A173353 A032815 * A041053 A212763 A103108
KEYWORD
nonn,base,easy
AUTHOR
Roger L. Bagula, Apr 28 2010
STATUS
approved