OFFSET
1,2
COMMENTS
From Sam Alexander, Oct 21 2003: (Start)
All palindromes (in decimal) occur in this sequence. If we can multiply a(k) by j without having to resort to any carrying over, then ja(k) is also in the sequence.
Saying that R(n) concat n is divisible by n is equivalent to saying that (10^d)R(n) is divisible by n, where d = the number of digits in n. (End)
Contains A008919. - Robert Israel, Jul 27 2015
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
12 is a member as 2112 is divisible by 12 and 13 is not as 3113 is not divisible by 13.
MAPLE
filter:= proc(n) local L, m, i, v;
L:= convert(n, base, 10);
m:= nops(L);
v:= add(10^(2*m-i)*L[i], i=1..m);
evalb(v mod n = 0);
end proc:
select(filter, [$1..10000]); # Robert Israel, Jul 26 2015
MATHEMATICA
Select[ Range[ 250 ],
Divisible[
FromDigits[
Flatten[ { Reverse[ IntegerDigits[ # ] ] ,
IntegerDigits[ # ] } ] ], # ] & ]
(* Kevin Southwick, Jul 25 2015 *)
Select[Range[250], Divisible[IntegerReverse[#]*10^IntegerLength[#]+#, #]&] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Mar 28 2020 *)
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003
EXTENSIONS
Corrected and extended by Sam Alexander, Oct 21 2003
STATUS
approved