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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A085094 Smallest k such that n*k-1 is a palindrome, or 0 if no such number exists. 2
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 6, 4, 3, 7, 2, 9, 8, 5, 13, 6, 1, 8, 4, 3, 6, 2, 7, 31, 15, 6, 4, 1, 13, 9, 36, 4, 2, 23, 17, 13, 4, 3, 1, 11, 20, 4, 13, 2, 2, 7, 170, 3, 9, 1, 11, 92, 6, 16, 2, 15, 13, 3, 7, 2, 1, 11, 37, 13, 2, 8, 9, 18, 126, 2, 791, 1, 11, 12, 2, 9, 5, 41 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,11 COMMENTS Conjecture: No entry is zero. For every n there exists a k such that n*k-1 is a palindrome. LINKS Table of n, a(n) for n=1..84. EXAMPLE a(13)=6 as 13*6-1=77, a palindrome. MATHEMATICA skpal[n_]:=Module[{k=1}, While[!PalindromeQ[k*n-1], k++]; k]; Array[skpal, 90] (* Harvey P. Dale, Jun 16 2022 *) CROSSREFS Sequence in context: A040151 A010213 A140378 * A010214 A318489 A121985 Adjacent sequences: A085091 A085092 A085093 * A085095 A085096 A085097 KEYWORD base,nonn AUTHOR Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jul 03 2003 EXTENSIONS More terms from Jason Earls, Jul 08 2003 STATUS approved

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 September 7 13:22 EDT 2024. Contains 375730 sequences. (Running on oeis4.)