login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A358618
First differences of A258036.
3
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, 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, 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
OFFSET
1,1
COMMENTS
Conjecture: All terms belong to {1, 2, 3}. See third comment in A258036.
LINKS
MAPLE
P:= <seq(ithprime(i), i=1..250)>:
S:= NULL: count:= 0:
for i from 2 while count < 101 do
P:= P[2..-1] - P[1..-2];
if P[1] < 0 then S:= S, i; count:= count+1; fi;
od:
S:= [S]:
S[2..-1]-S[1..-2]; # Robert Israel, Dec 21 2022
MATHEMATICA
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
CROSSREFS
Sequence in context: A188794 A161966 A187188 * A183027 A359227 A078178
KEYWORD
easy,nonn
AUTHOR
STATUS
approved