login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,11
COMMENTS
Conjecture: No entry is zero. For every n there exists a k such that n*k-1 is a palindrome.
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
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