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.

A331560 Size of the palindrome-free intervals about the 196-iterates, A006960.

This page as a plain text file.
%I A331560 #29 Apr 09 2020 22:21:54
%S A331560 11,10,110,110,100,100,110,1100,1000,11000,11000,11000,11000,10000,
%T A331560 10000,10000,11000,110000,110000,100000,100000,1100000,1100000,
%U A331560 1100000,1000000,1000000,11000000,11000000,10000000,10000000,110000000,110000000,110000000,100000000
%N A331560 Size of the palindrome-free intervals about the 196-iterates, A006960.
%C A331560 By empirical observation, the integers in this sequence are of the form 10*10^n and 11*10^n, n >= 0, since they are the difference of consecutive palindromes surrounding the 196-iterates. (No differences of 2 observed.)
%F A331560 a(n) = A331556(n) + A331557(n).
%e A331560 191 < 196 < 202, 202 - 191 = 11;
%e A331560 878 < 887 < 888, 888 - 878 = 10; etc.
%o A331560 (Python)
%o A331560 # Palindrome-free interval about 196 offsets. Slow brute-force
%o A331560 n = 196
%o A331560 while n < 10**15:
%o A331560      m = n
%o A331560      while m != int(str(m)[::-1]): m+=1
%o A331560      s = m
%o A331560      m = n
%o A331560      while m != int(str(m)[::-1]): m-=1
%o A331560      print(s-m)
%o A331560      n = n + int(str(n)[::-1])
%Y A331560 Cf. A006960, A331556, A331557.
%K A331560 nonn,base
%O A331560 1,1
%A A331560 _James D. Klein_, Jan 20 2020
%E A331560 a(31)-a(34) from _Jinyuan Wang_, Feb 29 2020