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.

A331557 The upper (or right) offset of a 196-iterate (A006960) from the smallest palindrome greater than the iterate.

This page as a plain text file.
%I A331557 #27 Mar 18 2023 16:28:26
%S A331557 6,1,96,11,48,11,10,693,732,231,110,10901,10901,5600,1100,110,1000,
%T A331557 12375,108911,96416,99901,470118,110,1089011,999074,110000,2508495,
%U A331557 109901,1770356,11,40076938,99110000,10901000,56662095,9911,137056546,1099890110,545350309
%N A331557 The upper (or right) offset of a 196-iterate (A006960) from the smallest palindrome greater than the iterate.
%C A331557 When normalized over (0,1) by their respective palindrome-free interval about a 196-iterate, it has been empirically observed that the frequency distribution of this sequence appears to be quite symmetric about 0.5, as well as fractal when plotting the distribution over decreasing bin sizes.
%C A331557 The 196-iterates referred to here come from the reverse-and-add process generating A006960.
%F A331557 a(n) = A331560(n) - A331556(n).
%e A331557 The first term is 6 since 202-196 = 6;
%e A331557 The second term is 1 since 888-887 = 1; etc.
%o A331557 (Python)
%o A331557 # Upper 196 offsets. Slow brute force
%o A331557 n = 196
%o A331557 while n < 10**15:
%o A331557   m = n
%o A331557   while m != int(str(m)[::-1]): m+=1
%o A331557   print(m-n)
%o A331557   n = n + int(str(n)[::-1])
%Y A331557 Cf. A006960, A331556, A006960.
%K A331557 nonn,base
%O A331557 1,1
%A A331557 _James D. Klein_, Jan 20 2020
%E A331557 More terms from _Jinyuan Wang_, Feb 29 2020