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 A343585 #9 Apr 22 2021 10:28:18 %S A343585 1,2,4,5,6,9,9,12,25,12,24,40,36,37,6,26,50,13,36,6,19,69,31,12,75,45, %T A343585 67,28,103,98,87,112,95,140,7,68,42,156,82,76,68,91,14,64,157,42,49, %U A343585 191,77,133,57,109,139,61,105,135,128,152,164,229,149,107,120,166,47,116,165,188,286,200,326 %N A343585 a(n) = A081411(n) mod prime(n+1). %C A343585 Do all positive integers appear in the sequence? %H A343585 Robert Israel, <a href="/A343585/b343585.txt">Table of n, a(n) for n = 1..10000</a> %e A343585 For n=4, a(4) = (3-2)*(5-3)*(7-5)*(11-7) mod 11 = 5. %p A343585 A081411[1]:= 1: %p A343585 for n from 2 to 200 do %p A343585 A081411[n]:= A081411[n-1]*(ithprime(n+1)-ithprime(n)) %p A343585 od: %p A343585 seq(A081411[n] mod ithprime(n+1), n=1..200); %Y A343585 Cf. A081411 %K A343585 nonn %O A343585 1,2 %A A343585 _J. M. Bergot_ and _Robert Israel_, Apr 20 2021