login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083463 a(n) = smallest number k such that 2^n + k is a palindrome. 0

%I #6 Aug 23 2014 15:01:12

%S 0,0,0,0,6,1,2,3,6,3,87,64,18,36,77,55,20,59,118,137,825,750,610,230,

%T 545,1101,2312,4703,9406,7723,31877,73764,27628,65266,27987,56975,

%U 15050,981259,971528,844057,532125,954360,897830,884770,2085155,5259321

%N a(n) = smallest number k such that 2^n + k is a palindrome.

%F a(n) = A052036(2^n). - _David Wasserman_, Nov 11 2004

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

%K base,nonn

%O 0,5

%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 01 2003

%E More terms from _David Wasserman_, Nov 11 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 02:28 EDT 2024. Contains 371782 sequences. (Running on oeis4.)