cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262198 Numbers such that the number of distinct palindromes contained as substring in their decimal representation differs from the length thereof.

This page as a plain text file.
%I A262198 #15 Jun 20 2018 06:54:21
%S A262198 100,200,300,400,500,600,700,800,900,1000,1001,1002,1003,1004,1005,
%T A262198 1006,1007,1008,1009,1010,1020,1021,1030,1031,1040,1041,1050,1051,
%U A262198 1060,1061,1070,1071,1080,1081,1090,1091,1100,1200,1201,1231,1241,1251,1261,1271
%N A262198 Numbers such that the number of distinct palindromes contained as substring in their decimal representation differs from the length thereof.
%C A262198 Or, numbers n such that A055642(n) != A262190(n).
%C A262198 a(22) = 1021 is the first term which differs from "numbers having at least two digits 0 in their decimal representation" (not in OEIS). It seems that A043490 is a subsequence. - _M. F. Hasler_, Jun 19 2018
%H A262198 Reinhard Zumkeller, <a href="/A262198/b262198.txt">Table of n, a(n) for n = 1..10000</a>
%e A262198 a(39) = 1201, containing just 3 trivial palindromes 0, 1 and 2;
%e A262198 1202, also of length = 4, contains exactly 4 palindromes 0, 1, 2 and 202, therefore 1202 is not a term.
%o A262198 (Haskell)
%o A262198 a262198 n = a262198_list !! (n-1)
%o A262198 a262198_list = [x | x <- [0..], a055642 x /= a262190 x]
%o A262198 (PARI) is(n)=#digits(n)!=A262190(n) \\ _M. F. Hasler_, Jun 19 2018
%Y A262198 Cf. A055642, A262190, A262188.
%K A262198 nonn,base
%O A262198 1,1
%A A262198 _Reinhard Zumkeller_, Sep 14 2015
%E A262198 Definition clarified by _M. F. Hasler_, Jun 19 2018