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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112725 Smallest positive palindromic multiple of 3^n. 2

%I

%S 1,3,9,999,999999999,29799999792,39789998793,39989598993,68899199886,

%T 68899199886,68899199886,68899199886,68899199886,2699657569962,

%U 146189959981641,191388777883191,191388777883191,18641845754814681

%N Smallest positive palindromic multiple of 3^n.

%C a(0)=1; a(1)=3 and it is easily shown that for n>1, 10^3^(n-2)-1 is a palindromic multiple of 3^n(see comments line of A062567). So for each n, a(n) exists and for n>1, a(n)<=10^3^(n-2)-1. This sequence is a subsequence of A020485(a(n)=A020485(3^n)) and for all n, A062567(3^n)<=a(n) because for all n, A062567(n)<= A020485(n). Jud McCranie conjectures that for n>1 A062567(3^n) =10^3^(n-2)-1, if his conjecture were true then from the above facts we conclude that for n>1 a(n)=10^3^(n-2)-1, but we see that for 4<n<=18 a(n) is much smaller than 10^3^(n-2)-1, so his conjecture will be rejected.

%e a(18)=18771463736417781 because 18771463736417781=3^18*48452429 is the smallest positive palindromic multiple of 3^18.

%t b[n_]:=(For[m=1, !FromDigits[Reverse[IntegerDigits[m*n]]]==m*n, m++ ]; m*n);Do[Print[b[3^n]], {n, 0, 18}]

%Y Cf. A020485, A062567, A112726.

%K base,nonn

%O 0,2

%A _Farideh Firoozbakht_, Nov 12 2005

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.

Last modified December 4 21:40 EST 2022. Contains 358570 sequences. (Running on oeis4.)