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 A062091 #13 Jul 08 2025 06:08:56
%S A062091 2,4,6,10,14,18,22,26,34,38,46,50,58,62,74,82,86,94,98,106,118,122,
%T A062091 134,142,146,158,162,166,178,194,202,206,214,218,226,242,254,262,274,
%U A062091 278,298,302,314,326,334,338,346,358,362,382,386,394,398,422,446,454
%N A062091 a(1) = 2, a(n)= smallest even number which does not divide the product of all previous terms.
%H A062091 Michael De Vlieger, <a href="/A062091/b062091.txt">Table of n, a(n) for n = 1..10000</a>
%F A062091 2 and 4 together with numbers of the form 2*{p^(2^k)} where p is an odd prime and k is a nonnegative integer. [Corrected by _Peter Munn_, Nov 03 2020]
%F A062091 Conjecture: a(n) = 2*A062090(n-1) for n>=3. - _R. J. Mathar_, Jul 08 2025
%e A062091 After 10 the next term in the sequence is 14 (not 12) as 12 = 2*6 divides the product of all the previous terms.
%t A062091 Block[{a = {2}, k = 4, P = 1}, Do[Set[P, P*a[[-1]]]; While[Mod[P, k] == 0, k += 2]; AppendTo[a, k], {i, 2, 56}]; a] (* _Michael De Vlieger_, Nov 04 2020 *)
%Y A062091 Cf. A026477, A062090.
%K A062091 nonn
%O A062091 1,1
%A A062091 _Amarnath Murthy_, Jun 16 2001
%E A062091 More terms from _Dean Hickerson_, Jul 10 2001