OFFSET
1,2
COMMENTS
The sum of the distinct prime factors of n is sometimes called sopf(n).
LINKS
Éric Angelini, Sums of distinct prime factors, Personal blog, December 2023.
EXAMPLE
a(1) + a(2) = 1 + 2 = 3 whose sopf is 3, a prime number;
a(2) + a(3) = 2 + 3 = 5 whose sopf is 5, a prime number;
a(7) + a(8) = 7 + 9 = 16 whose sopf is 2, a prime number;
a(8) + a(9) = 9 + 8 = 17 whose sopf is 17, a prime number;
a(9) + a(10) = 8 + 10 = 18 whose sopf is 2 + 3 = 5, a prime number; etc.
MATHEMATICA
a[1]=1; a[n_]:=a[n]=(k=1; While[MemberQ[Array[a, n-1], k]||!PrimeQ@Total[First/@FactorInteger[k+a[n-1]]], k++]; k); Array[a, 81]
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric Angelini and Giorgos Kalogeropoulos, Dec 05 2023
STATUS
approved