A086862 Differences between successive palindromes.

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, 10, 10, 11, 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, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10

Offset: 1

Author

Karl Goiser (kggoiser(AT)utas.edu.au), Aug 20 2003

Keywords

• nonn
• base

Examples

			The first 10 palindromes are 0, 1, ..., 9 yielding 9 ones for the first terms of this sequence.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A002113.

Programs

Haskell

a086862 n = a086862_list !! (n-1)
a086862_list = zipWith (-) (tail a002113_list) a002113_list
-- Reinhard Zumkeller, Jul 30 2015

Mathematica

Differences[Select[Range[0,1000],PalindromeQ]] (* Harvey P. Dale, Oct 04 2023 *)

Formula

a(n) = A002113(n+1) - A002113(n). - Michel Marcus, Jun 30 2014

Extensions

One additional 1 prepended by Michel Marcus, Jun 30 2014