|
| |
|
|
A086862
|
|
Differences between successive palindromes.
|
|
2
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,10
|
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
|
a(n) = A002113(n+1) - A002113(n). - Michel Marcus, Jun 30 2014
|
|
|
EXAMPLE
|
The first 10 palindromes are 0, 1, ..., 9 yielding 9 ones for the first terms of this sequence.
|
|
|
PROG
|
(Haskell)
a086862 n = a086862_list !! (n-1)
a086862_list = zipWith (-) (tail a002113_list) a002113_list
-- Reinhard Zumkeller, Jul 30 2015
|
|
|
CROSSREFS
|
Cf. A002113.
Sequence in context: A153521 A153650 A256665 * A027828 A106371 A145523
Adjacent sequences: A086859 A086860 A086861 * A086863 A086864 A086865
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
Karl Goiser (kggoiser(AT)utas.edu.au), Aug 20 2003
|
|
|
EXTENSIONS
|
One additional 1 prepended by Michel Marcus, Jun 30 2014
|
|
|
STATUS
|
approved
|
| |
|
|
