Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161400
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161400 Positive integers that are palindromes (of even length) in binary, each made by concatenating two identical binary palindromes. +0
1
3, 15, 45, 63, 153, 255, 561, 693, 891, 1023, 2145, 2925, 3315, 4095, 8385, 9417, 10965, 11997, 12771, 13803, 15351, 16383, 33153, 39321, 42405, 48573, 50115, 56283, 59367, 65535, 131841, 140049, 152361, 160569, 166725, 174933, 187245 (list; graph; listen)
OFFSET

1,1

COMMENT

If m is the n-th positive integer that is a binary palindrome, and m written in binary is k digits long, then a(n) = m*(2^k +1).

FORMULA

a(n) = (2^A070939(p)+1)*p where p = A006995(n+1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 27 2009]

EXAMPLE

The first eight terms of this sequence written in binary:

11, 1111, 101101, 111111, 10011001, 11111111, 1000110001, 1010110101

CROSSREFS

A006995

Sequence in context: A147057 A101165 A127407 this_sequence A112810 A094191 A050534

Adjacent sequences: A161397 A161398 A161399 this_sequence A161401 A161402 A161403

KEYWORD

base,nonn

AUTHOR

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

EXTENSIONS

Extended beyond 693 by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 27 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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research