|
%I #14 Apr 05 2015 11:02:56
%S 2,2,3,3,5,5,5,7,7,7,11,11,11,11,11,13,13,13,13,13,17,17,17,17,17,19,
%T 19,19,19,19,19,19,23,23,23,23,23,23,23,29,29,29,29,29,29,29,31,31,31,
%U 31,31,31,31,31,31,31,31,37,37,37,37,37,37,37,37,37,37,37
%N Golomb-type sequence over primes.
%C Suggested by Golomb's sequence A001462.
%C Terms are primes in nondecreasing order; a(n) gives length of n-th run.
%C It is understood that a(n) is taken to be the smallest number >= a(n-1) which is compatible with the description.
%H Ivan Neretin, <a href="/A169682/b169682.txt">Table of n, a(n) for n = 1..10000</a>
%t a = {2, 2}; Do[a = Join[a, Array[Prime[i]&, a[[i]]]], {i, 2, 12}]; a (* _Ivan Neretin_, Apr 03 2015 *)
%Y Cf. A001462.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, following a posting to the Sequence Fans mailing list by _Eric Angelini_, Apr 13 2010
|
