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”).
%I #7 Mar 11 2014 01:32:23
%S 1,1,2,1,2,1,2,3,1,2,1,2,3,1,2,1,2,3,1,2,3,4,5,1,2,1,2,3,1,2,1,2,3,1,
%T 2,3,4,5,1,2,1,2,3,1,2,1,2,3,1,2,3,4,5,1,2,1,2,3,1,2,3,4,5,1,2,3,4,5,
%U 6,7,1,2,3,4,5,6,7,8,9,10,11,1,2,1,2,3,1,2,1,2,3,1,2,3,4,5,1,2,1,2,3,1,2,1
%N a(1) = 1. After the initial 1, follow with runs of integers; the n-th run of p(a(n)) terms is (1,2,3,4,....,p(a(n))), where p(m) is the m-th prime.
%e Runs of integers bracketed by parentheses. (Note that n-th run {after the initial 1} has exactly p(a(n)) terms.)
%e 1,(1,2),(1,2),(1,2,3),(1,2),(1,2,3),(1,2),(1,2,3),(1,2,3,4,5),(1,2),(1,2,3),(1,2),(1,2,3),(1,2,3,4,5),(1,2),(1,2,3),(1,2),(1,2,3),(1,2,3,4,5),(1,2),(1,2,3),(1,2,3,4,5),(1,2,3,4,5,6,7),(1,2,3,4,5,6,7,8,9,10,11),...
%K nonn
%O 1,3
%A _Leroy Quet_, Mar 15 2008