Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161980
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161980 a(n) = the smallest positive multiple of n containing {the string made by reversing the order of the binary digits of n, and removing leading 0's} as a substring when a(n) is written in binary. +0
3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 55, 12, 91, 14, 15, 16 (list; graph; listen)
OFFSET

1,2

EXAMPLE

13 in binary is 1101, which reversed is 1011. a(13) = the positive multiple of 13 that contains the string 1011 as a substring in its binary representation. a(13) therefore equals 91 = 7*13, which is 1011011 in binary. (Binary 91 actually contains the substring 1011 twice.)

CROSSREFS

A030101, A1619879

Sequence in context: A141709 A062683 A137857 this_sequence A132576 A161948 A004861

Adjacent sequences: A161977 A161978 A161979 this_sequence A161981 A161982 A161983

KEYWORD

base,more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 23 2009

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research