A241911 - OEIS

A241911

After a(1)=1, numbers 1 .. bigomega(n), followed by numbers 1 .. bigomega(n+1), etc., where bigomega(n)=A001222(n) is the number of prime factors of n (with repetition).

1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 2, 1, 1, 2, 3, 1, 1, 2, 1, 2, 1, 2, 3, 4, 1, 1, 2, 3, 1, 1, 2, 3, 1, 2, 1, 2, 1, 1, 2, 3, 4, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 1, 2, 3, 1, 1, 2, 3, 4, 5, 1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 1, 1, 2, 1, 2, 1, 2, 3, 4, 1, 1, 2, 3, 1, 1, 2, 3, 1, 2, 3, 1, 2, 1, 1, 2, 3, 4, 5, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 1, 2, 3, 4, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,5

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

FORMULA

a(1)=1, a(n) = n - A022559(A082288(n)-1) - 1.

EXAMPLE

Viewed as an irregular table, the sequence is constructed as:

"Row"

[1] 1; (by convention, a(1)=1)

[2] 1; (because bigomega(2)=1, we have here terms from 1 to 1)