

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).


3



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



FORMULA



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)
[3] 1; (same with 3, bigomega(3)=1)
[4] 1, 2; (as bigomega(4)=2, we have terms from 1 to 2)
[5] 1;
[6] 1, 2;
[7] 1;
[8] 1, 2, 3; (as bigomega(8)=3, we have terms from 1 to 3).
etc.


PROG



CROSSREFS



KEYWORD

nonn,tabf


AUTHOR



STATUS

approved



