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 A333648 #10 May 03 2020 15:59:32
%S A333648 30,510,300,8160,30,5910,3000,87860,3030,58710,30300,907980,3000,
%T A333648 496200,199980,3030,76920,3000,20070,8897800,3000,251930,30000,517870,
%U A333648 89010,117320,3000,87970,61980,4092720,36980,68020,522380,191620,106230,1621950,7200,620
%N A333648 Bemirp gaps: differences between consecutive bemirps.
%C A333648 The smallest gap is 10 = 16611666611 - 16611666601 and all terms are divisible by 10 as a result of the rule that all bemirps have to end with 1. Bemirp pairs with a gap 10 are 16611666601, 16611666611, 19911999901, 19911999911, ... .
%F A333648 a(n) = A048895(n+1) - A048895(n).
%e A333648 a(1) = 1091 - 1061 = 30.
%t A333648 A048895 = Cases[Import["https://oeis.org/A048895/b048895.txt", "Table"], {_, _}][[All, 2]];a[n_] := A048895[[n+1]]-A048895[[n]];a /@ Range[1,100] (* based on A048895 b-file *)
%Y A333648 Cf. A001223, A037010, A048895, A185439.
%K A333648 nonn,base,easy
%O A333648 1,1
%A A333648 _Metin Sariyar_, Mar 31 2020