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!)
A083478 a(n) is the smallest k > 0 such that k*Palindrome(n)+1 is a palindrome. 2
1, 1, 1, 1, 1, 1, 1, 1, 6, 10, 5, 7, 8, 2, 9, 3, 4, 6, 100, 10, 5, 4, 3, 2, 2, 2, 2, 2, 50, 50, 5, 4, 3, 2, 2, 2, 2, 2, 40, 40, 40, 7, 797, 2, 2, 2, 2, 2, 25, 30, 25, 420, 8, 2, 2, 2, 2, 2, 20, 20, 20, 20, 20, 2, 32, 117, 24, 28, 20, 20, 20, 20, 20, 89, 9, 52, 1870, 150, 20, 20, 20, 20, 20, 85 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,9
LINKS
FORMULA
a(n) = (A083477(n)-1)/A002113(n). a(n) = A082744(A002113(n)). - David Wasserman, Nov 16 2004
EXAMPLE
a(11) = 5 because A002113(11) = 22 and 111 = 5*22+1.
MATHEMATICA
skpal[n_]:=Module[{k=1}, While[!PalindromeQ[k*n+1], k++]; k]; skpal/@Select[ Range[ 1000], PalindromeQ] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jul 22 2018 *)
CROSSREFS
Cf. A083477.
Sequence in context: A347632 A144763 A280302 * A328202 A306368 A075368
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 03 2003
EXTENSIONS
Corrected and extended by David Wasserman, Nov 16 2004
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 01:34 EDT 2024. Contains 370952 sequences. (Running on oeis4.)