The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176892 Decimal representation of the reverted binary representation of n followed by digits substitution 0->2, 1->3. 1
2, 3, 23, 33, 223, 323, 233, 333, 2223, 3223, 2323, 3323, 2233, 3233, 2333, 3333, 22223, 32223, 23223, 33223, 22323, 32323, 23323, 33323, 22233, 32233, 23233, 33233, 22333, 32333, 23333, 33333, 222223, 322223, 232223, 332223, 223223 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Revert the digits of A007088(n), preserving zeros, and increase each digit by 2 (add the repunit A002276 with the same number of digits).
LINKS
EXAMPLE
n=10 is A007088(10)= 1010 in binary, reverted 0101. Adding 2222 generates a(10)=2323.
MATHEMATICA
Table[Sum[Table[((IntegerDigits[ n, 2]) /. 0 -> 2) /. 1 -> 3, {n, 0, 50}][[n]][[m]]*10^(m - 1),
{m, 1, Length[Table[((IntegerDigits[n, 2]) /. 0 -> 2) /. 1 -> 3, {n, 0, 50}][[n]]]}], {n, 1, 51}]
PROG
(Haskell)
import Data.List (unfoldr); import Data.Tuple (swap)
a176892 0 = 2a176892 n = foldl (\v d -> 10 * v + d + 2) 0 $
unfoldr (\x -> if x == 0 then Nothing else Just $ swap $ divMod x 2) n
-- Reinhard Zumkeller, Jul 16 2015
CROSSREFS
Sequence in context: A024764 A213971 A024773 * A109615 A101001 A231477
KEYWORD
nonn,base,easy
AUTHOR
Roger L. Bagula, Apr 28 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 23:01 EDT 2024. Contains 372847 sequences. (Running on oeis4.)