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 A228891 #23 Jan 03 2021 12:59:41
%S A228891 2,3,5,7,13,13,17,17,17,41,59,29,41,53,37,67,79,61,89,101,139,71,67,
%T A228891 83,151,101,89,127,163,137,101,103,131,181,139,139,181,181,139,317,
%U A228891 191,313,163,197,199,389,191,233,229,337,239,229,347,881,239,283,487
%N A228891 Let A = A050376. Let Q be the smallest term of A more than 1 + Product_{i=1..n} A(i). a(n) = Q - Product_{i=1..n} A(i).
%C A228891 This sequence is a Fermi-Dirac analog of the Fortunate numbers (A005235).
%H A228891 Peter J. C. Moses, <a href="/A228891/b228891.txt">Table of n, a(n) for n = 1..1000</a>
%e A228891 a(1) = 2, since 1 + Product_{i=1} A(i) = 1 + 2 = 3, the smallest term Q of A050376 more than 3 is 4 and a(1) = 4-2 = 2; let n=4, then 1 + Product_{i=1..4} A(i) = 1 + 2*3*4*5 = 121 and the smallest term Q of A050376 more than 121 is 127. So a(4) = 127 - 120 = 7.
%Y A228891 Cf. A005235, A050376.
%K A228891 nonn
%O A228891 1,1
%A A228891 _Vladimir Shevelev_, Sep 07 2013
%E A228891 More terms from _Peter J. C. Moses_, Sep 10 2013