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.
%I A163139 #11 Mar 04 2019 01:50:35
%S A163139 1,1,1,1,10,10,10,10,10,10,10,10,10,1,10,10,10,10,10,10,10,10,10,1,10,
%T A163139 10,10,10,10,10,10,10,10,1,10,10,10,10,10,10,10,10,10,1,10,10,10,10,
%U A163139 10,10,10,10,10,1,10,10,10,10,10,10,10,10,10,1,10,10,10,10,10,10,10,10,10,1,10
%N A163139 First differences of A163128.
%C A163139 First differences of self numbers, minus 1.
%F A163139 a(n) = A163128(n+1) - A163128(n) = A003052(n+1) - A003052(n) - 1.
%e A163139 a(6) = 24 - 14 = 10.
%p A163139 A007953 := proc(n) add(d,d=convert(n,base,10)) ; end:
%p A163139 isA003052 := proc(n) for k from 1 to n do if k+A007953(k) = n then RETURN(false) ; fi; od: true; end:
%p A163139 A003052 := proc(n) option remember; if n = 1 then 1; else for a from procname(n-1)+1 do if isA003052(a) then RETURN(a) ; fi; od: fi; end:
%p A163139 for n from 1 to 100 do printf("%d,",A003052(n+1)-A003052(n)-1) ; od: # _R. J. Mathar_, Jul 31 2009
%Y A163139 Cf. A003052, A163128.
%K A163139 nonn,base
%O A163139 1,5
%A A163139 _Juri-Stepan Gerasimov_, Jul 21 2009
%E A163139 Missing 10's inserted by _R. J. Mathar_, Jul 31 2009