|
%I #10 Oct 10 2018 09:40:07
%S 1,2,3,4,5,6,7,8,9,55,11,111,121,66,99,121,33,171,55,77,101,22,111,
%T 323,121,101,131,55,141,88,121,373,33,232,171,141,181,1111,77,313,121,
%U 575,505,44,353,181,323,424,1441,99,101,868,313,10601,55,111,393,343,929,414
%N a(0)=1, a(1)=2; for n >= 2, a(n) is smallest palindrome greater than 1 which is congruent to 1 (mod n).
%F a(n) = A077528(n) for n >= 2. - _Georg Fischer_, Oct 06 2018
%t f[n_] := Block[{k = 2}, While[ FromDigits[ Reverse[ IntegerDigits[k]]] != k || Mod[k, n] != 1, k++ ]; k]; Table[ f[n], {n, 2, 60}]
%Y Cf. A082744, A062388, A077528.
%K base,nonn
%O 0,2
%A _Amarnath Murthy_, Apr 15 2003
%E Edited and extended by _Robert G. Wilson v_, Apr 19 2003
|
