The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A251559 a(n) = 2 more than the largest odd number among {A098550(1), A098550(2), ..., A098550(n)} which is neither a prime nor a term of A251542. 4
 9, 9, 9, 9, 15, 15, 21, 21, 21, 21, 21, 21, 39, 39, 39, 39, 39, 39, 39, 39, 45, 45, 45, 45, 45, 49, 49, 55, 55, 55, 55, 55, 55, 57, 57, 69, 69, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 99, 99, 105, 105, 105, 105, 121 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..70. David L. Applegate, Hans Havermann, Bob Selcoe, Vladimir Shevelev, N. J. A. Sloane, and Reinhard Zumkeller, The Yellowstone Permutation, arXiv preprint arXiv:1501.01669 [math.NT], 2015 and J. Int. Seq. 18 (2015) 15.6.7. CROSSREFS Cf. A098550, A251546, A251557, A251558. Sequence in context: A286833 A216852 A251558 * A068395 A245429 A242893 Adjacent sequences: A251556 A251557 A251558 * A251560 A251561 A251562 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 23 2014 STATUS approved

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

Last modified December 4 01:51 EST 2023. Contains 367541 sequences. (Running on oeis4.)