login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103166 a(n)=Mod[reversed(2^n),2^n], remainder if backward-written-2^n is divided by 2^n. 1

%I

%S 0,0,0,13,23,46,53,140,215,105,210,2808,2918,15593,21187,63556,7987,

%T 179118,358137,466945,420750,4034914,8068838,10946113,23445533,

%U 46880176,22406063,117663950,219078635,1060248229,2021396468,2632727628

%N a(n)=Mod[reversed(2^n),2^n], remainder if backward-written-2^n is divided by 2^n.

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

%Y Cf. A002113, A071590, A103164-A103167.

%K base,nonn

%O 1,4

%A _Labos Elemer_, Jan 28 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 10:51 EDT 2021. Contains 346373 sequences. (Running on oeis4.)