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!)
A103166 a(n) = reverse(2^n) mod 2^n. 1
0, 0, 0, 13, 23, 46, 53, 140, 215, 105, 210, 2808, 2918, 15593, 21187, 63556, 7987, 179118, 358137, 466945, 420750, 4034914, 8068838, 10946113, 23445533, 46880176, 22406063, 117663950, 219078635, 1060248229, 2021396468, 2632727628, 2954399858, 13837158803 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Remainder if (2^n written backwards) is divided by 2^n.

LINKS

Table of n, a(n) for n=1..34.

EXAMPLE

a(4) = reverse(2^4) mod 2^4 = reverse(16) mod 16 = 61 mod 16 = 13.

MATHEMATICA

Table[Mod[FromDigits[Reverse[IntegerDigits[2^n]]], 2^n], {n, 1, 256}]

PROG

(Python)

def a(n): t = 2**n; return int(str(t)[::-1])%t

print([a(n) for n in range(1, 35)]) # Michael S. Branicky, Dec 12 2021

CROSSREFS

Cf. A002113, A071590, A103164-A103167.

Sequence in context: A320752 A213665 A068712 * A154863 A194156 A139863

Adjacent sequences:  A103163 A103164 A103165 * A103167 A103168 A103169

KEYWORD

base,nonn

AUTHOR

Labos Elemer, Jan 28 2005

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 July 7 00:24 EDT 2022. Contains 355115 sequences. (Running on oeis4.)