login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132387 a(n) = n with each digit d of n replaced by d mod 4. 1
0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 10, 11, 12, 13, 10, 11, 12, 13, 10, 11, 20, 21, 22, 23, 20, 21, 22, 23, 20, 21, 30, 31, 32, 33, 30, 31, 32, 33, 30, 31, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 10, 11, 12, 13, 10, 11, 12, 13, 10, 11, 20, 21, 22, 23, 20, 21, 22, 23, 20, 21, 30, 31, 32, 33, 30, 31, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..5000

EXAMPLE

a(n) == n (mod 4) for n=0..9; a(n)=n for n=10..13; a(14)=10, a(15)=11,

a(41)=a(81)=1, etc.

MATHEMATICA

Table[FromDigits[Mod[IntegerDigits[n], 4]], {n, 0, 80}] (* Harvey P. Dale, Aug 25 2014 *)

CROSSREFS

Sequence in context: A010873 A049804 A277904 * A124757 A242305 A049263

Adjacent sequences:  A132384 A132385 A132386 * A132388 A132389 A132390

KEYWORD

base,nonn

AUTHOR

Zak Seidov, Nov 20 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified June 23 21:09 EDT 2018. Contains 311812 sequences. (Running on oeis4.)