login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A361228
a(n) is the first number k such that k + a(i) has n prime factors, counted with multiplicity, for all i < n; a(0) = 0.
1
0, 2, 4, 66, 1012, 14630, 929390, 63798350, 19371451550
OFFSET
0,2
COMMENTS
a(8) > 3*10^9 if it exists.
FORMULA
A001222(a(i) + a(j)) = j for 0 <= i < j.
EXAMPLE
a(3) = 66 because a(0) + 66 = 66 = 2*3*11, a(1) + 66 = 68 = 2*2*17, and a(2) + 66 = 70 = 2*5*7 all have 3 prime factors, counted with multiplicity, and 66 is the least number that works.
MAPLE
A:= [0]:
for i from 1 to 7 do
for x from 2^i do if andmap(t -> numtheory:-bigomega(t+x) = i, A) then
A:= [op(A), x]; break
fi od od:
A;
CROSSREFS
Cf. A001222.
Sequence in context: A118993 A219735 A279969 * A018364 A100603 A374235
KEYWORD
nonn,more
AUTHOR
Robert Israel, Mar 21 2023
EXTENSIONS
a(8) from Daniel Suteu, Nov 08 2024
STATUS
approved