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!)
A103167 a(n) = 2^n mod reverse(2^n). 2
0, 0, 0, 16, 9, 18, 128, 256, 82, 1024, 2048, 4096, 2356, 16384, 32768, 1980, 131072, 262144, 524288, 1048576, 2097152, 159390, 319770, 16777216, 10108899, 20228688, 134217728, 268435456, 98713642, 1073741824, 2147483648, 4294967296, 2681134876, 17179869184 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Remainder if 2^n is divided by the reverse of 2^n.

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

EXAMPLE

a(5) = 2^5 mod reverse(2^5) = 32 mod reverse(32) = 32 mod 23 = 9.

MATHEMATICA

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

Table[PowerMod[2, n, IntegerReverse[2^n]], {n, 40}] (* Harvey P. Dale, Jan 30 2022 *)

PROG

(Python)

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

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

CROSSREFS

Cf. A002113, A071590, A103164-A103167.

Sequence in context: A257796 A070688 A281719 * A303317 A154615 A040242

Adjacent sequences:  A103164 A103165 A103166 * A103168 A103169 A103170

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 September 27 19:37 EDT 2022. Contains 357063 sequences. (Running on oeis4.)