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”).
%I #22 Jul 24 2020 01:46:39
%S 192572,448,50946,5216,154980,92322,28672,300270,30926,30522,294348,
%T 30898,228104,105316,15362,138154,353430,56,60432,318646,31424,34488,
%U 355678,224,151732,14336,457534,52658,458752,28856,478140,881790,386158,292716,896,422284,119078,1792,63774
%N First differences of (provable) Sierpiński numbers (A076336).
%C If we analyze the b-file of A076336, we see that most repeated values of a(n) are the form of 14*(2^k), for k >= 0. For the first 15000 (provable) Sierpiński numbers, there are 200 times 14, 201 times 28, 200 times 56, 200 times 112, 201 times 224, 200 times 448, 199 times 896, 200 times 1792, 200 times 3584 in this sequence.
%C Additionally, 14 appears as a minimum difference between consecutive (provable) Sierpiński numbers for the first 15000 terms that are listed in b-file of A076336. Graph of the sequence that is integers n such that A076336(n+1) = A076336(n) + 14 seems approximately linear.
%C The minimum value of this sequence is 2, as the numbers 3913004084027, 3913004084029 are consecutive odd numbers that are both Sierpinski numbers. - _Robert Gelhar_, Jul 23 2020
%F a(n) = A076336(n+1) - A076336(n).
%e a(1) = A076336(2) - A076336(1) = 271129 - 78557 = 192572.
%Y Cf. A076336.
%K nonn
%O 1,1
%A _Altug Alkan_, Mar 27 2016