The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112725 Smallest positive palindromic multiple of 3^n. 2
 1, 3, 9, 999, 999999999, 29799999792, 39789998793, 39989598993, 68899199886, 68899199886, 68899199886, 68899199886, 68899199886, 2699657569962, 146189959981641, 191388777883191, 191388777883191, 18641845754814681 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS 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

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 October 6 05:47 EDT 2022. Contains 357261 sequences. (Running on oeis4.)