%I #10 Oct 04 2023 12:19:48
%S 1,1,1,1,1,1,1,1,1,2,11,11,11,11,11,11,11,11,2,10,10,10,10,10,10,10,
%T 10,10,11,10,10,10,10,10,10,10,10,10,11,10,10,10,10,10,10,10,10,10,11,
%U 10,10,10,10,10,10,10,10,10,11,10,10,10,10,10,10,10,10,10,11,10,10,10,10,10
%N Differences between successive palindromes.
%H Reinhard Zumkeller, <a href="/A086862/b086862.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A002113(n+1) - A002113(n). - _Michel Marcus_, Jun 30 2014
%e The first 10 palindromes are 0, 1, ..., 9 yielding 9 ones for the first terms of this sequence.
%t Differences[Select[Range[0,1000],PalindromeQ]] (* _Harvey P. Dale_, Oct 04 2023 *)
%o (Haskell)
%o a086862 n = a086862_list !! (n-1)
%o a086862_list = zipWith (-) (tail a002113_list) a002113_list
%o -- _Reinhard Zumkeller_, Jul 30 2015
%Y Cf. A002113.
%K nonn,base
%O 1,10
%A Karl Goiser (kggoiser(AT)utas.edu.au), Aug 20 2003
%E One additional 1 prepended by _Michel Marcus_, Jun 30 2014