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 A358618 #16 Dec 21 2022 12:53:48 %S A358618 2,2,2,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2, %T A358618 2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2, %U A358618 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2 %N A358618 First differences of A258036. %C A358618 Conjecture: All terms belong to {1, 2, 3}. See third comment in A258036. %H A358618 Robert Israel, <a href="/A358618/b358618.txt">Table of n, a(n) for n = 1..10000</a> %p A358618 P:= <seq(ithprime(i),i=1..250)>: %p A358618 S:= NULL: count:= 0: %p A358618 for i from 2 while count < 101 do %p A358618 P:= P[2..-1] - P[1..-2]; %p A358618 if P[1] < 0 then S:= S,i; count:= count+1; fi; %p A358618 od: %p A358618 S:= [S]: %p A358618 S[2..-1]-S[1..-2]; # _Robert Israel_, Dec 21 2022 %t A358618 nn = 210; p = Prime@ Range@ nn; t = Table[ Differences[p, n][[1]], {n, 0, nn - 1}]; s = Select[ Range@ nn, t[[#]] < 0 &]; d = Differences@ s %Y A358618 Cf. A258036, A358619. %K A358618 easy,nonn %O A358618 1,1 %A A358618 _Clark Kimberling_ and _Robert G. Wilson v_, Oct 31 2022