cp's OEIS Frontend

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.

A051318 Euclid-Mullin sequence (A000945) with initial value a(1)=43 instead of a(1)=2.

This page as a plain text file.
%I A051318 #24 Oct 08 2023 18:19:25
%S A051318 43,2,3,7,13,53,5,6221671,38709183810571,139,2801,11,17,5471,52662739,
%T A051318 23003,30693651606209,37,1741,1313797957,887,71,7127,109,23,97,159227,
%U A051318 643679794963466223081509857,103,1079990819,9539,3143065813,29,3847,89,19,577,223
%N A051318 Euclid-Mullin sequence (A000945) with initial value a(1)=43 instead of a(1)=2.
%H A051318 Tyler Busby, <a href="/A051318/b051318.txt">Table of n, a(n) for n = 1..51</a> (terms 1..43 from Robert Price)
%e A051318 Product of first 28 terms +1 is 210102491806660945690525037461258737117339882568590700172677987135969766432980375 44232424110733238484973548134278212304532631, which is divisible by 103. Hence a(29)=103.
%t A051318 a[1]=43; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, n-1} ] ] ] ]; Array[a, 15]
%o A051318 (PARI) spf(n)=factor(n)[1, 1]
%o A051318 first(m)={my(v=vector(m),i,t=43);v[1]=43;for(i=2,m,v[i]=spf(t+1);t*=v[i];);v;} /* _Anders Hellström_, Jul 19 2015 */
%Y A051318 Agrees with A000945 from 5th term. Cf. A000946, A005265, A005266.
%K A051318 nonn
%O A051318 1,1
%A A051318 _Labos Elemer_
%E A051318 a(31)-a(38) from _Robert Price_, Jul 19 2015