Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103166
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103166 a(n)=Mod[reversed(2^n),2^n], remainder if backward-written-2^n is divided by 2^n. +0
2
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 (list; graph; listen)
OFFSET

1,4

MATHEMATICA

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

CROSSREFS

Cf. A002113, A071590, A103164-A103167.

Sequence in context: A112394 A067227 A068712 this_sequence A154863 A155049 A139863

Adjacent sequences: A103163 A103164 A103165 this_sequence A103167 A103168 A103169

KEYWORD

base,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jan 28 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research