Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083463
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083463 a(n) = smallest number k such that 2^n + k is a palindrome. +0
1
0, 0, 0, 0, 6, 1, 2, 3, 6, 3, 87, 64, 18, 36, 77, 55, 20, 59, 118, 137, 825, 750, 610, 230, 545, 1101, 2312, 4703, 9406, 7723, 31877, 73764, 27628, 65266, 27987, 56975, 15050, 981259, 971528, 844057, 532125, 954360, 897830, 884770, 2085155, 5259321 (list; graph; listen)
OFFSET

0,5

FORMULA

a(n) = A052036(2^n). - David Wasserman (wasserma(AT)spawar.navy.mil), Nov 11 2004

EXAMPLE

a(9) = 3 as 2^9 = 512, 512 +3 = 515 is a palindrome.

CROSSREFS

Sequence in context: A164809 A089128 A106687 this_sequence A013672 A019946 A090551

Adjacent sequences: A083460 A083461 A083462 this_sequence A083464 A083465 A083466

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), May 01 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Nov 11 2004

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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research