This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A169682 Golomb-type sequence over primes. 2
 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, 19, 19, 19, 19, 19, 19, 23, 23, 23, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 29, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Suggested by Golomb's sequence A001462. Terms are primes in nondecreasing order; a(n) gives length of n-th run. It is understood that a(n) is taken to be the smallest number >= a(n-1) which is compatible with the description. LINKS Ivan Neretin, Table of n, a(n) for n = 1..10000 MATHEMATICA a = {2, 2}; Do[a = Join[a, Array[Prime[i]&, a[[i]]]], {i, 2, 12}]; a (* Ivan Neretin, Apr 03 2015 *) CROSSREFS Cf. A001462. Sequence in context: A059974 A045767 A108221 * A082524 A099961 A286107 Adjacent sequences:  A169679 A169680 A169681 * A169683 A169684 A169685 KEYWORD nonn AUTHOR N. J. A. Sloane, following a posting to the Sequence Fans mailing list by Eric Angelini, Apr 13 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.