login
a(0) = 2. For n >= 1, a(n) is the least prime p such that a(n-1) + p has n prime factors counted with multiplicity.
0

%I #8 Jun 22 2023 06:03:59

%S 2,3,3,5,11,37,59,229,347,421,3163,4517,1627,26021,14939,34213,64091,

%T 378277,14939,3392933,146011,6931877,8796763,37340581,25573979,

%U 238667173,113654363,1018807717,491141723,4743349669,8544205403,10246276517,491141723

%N a(0) = 2. For n >= 1, a(n) is the least prime p such that a(n-1) + p has n prime factors counted with multiplicity.

%F A001222(a(n-1) + a(n)) = n.

%e a(5) = 37 because a(4) + 37 = 48 = 2^4*3 has 5 prime factors counted with multiplicity.

%p R:= 2: t:= 2:

%p for n from 1 to 30 do

%p p:= 1:

%p do p:= nextprime(p)

%p until numtheory:-bigomega(t+p) = n;

%p R:= R,p;

%p t:= p;

%p od:

%p R;

%t s={2};Do[p=2;While[PrimeOmega[s[[-1]]+p]!=

%t k,p=NextPrime[p]];Print[p];AppendTo[s,p],{k,1,50}];

%Y Cf. A001222, A357713.

%K nonn

%O 0,1

%A _Zak Seidov_ and _Robert Israel_, Jun 21 2023