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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259543 Smallest m such that A259542(m) = 2*n-1. 2
 1, 6, 2, 3, 7, 8, 4, 19, 5, 9, 14, 10, 24, 20, 21, 25, 11, 15, 16, 12, 26, 22, 37, 23, 27, 13, 17, 56, 18, 32, 28, 42, 38, 39, 43, 29, 33, 51, 55, 54, 50, 34, 30, 44, 40, 71, 41, 45, 31, 35, 57, 53, 92, 52, 58, 36, 68, 46, 76, 72, 73, 77, 47, 67, 63, 59, 87 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Sequence is defined for all n iff A259542 is a permutation of the odd numbers; A259542(a(n)) = 2*n-1. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a259543 = (+ 1) . fromJust . (`elemIndex` a259542_list) . subtract 1 . (* 2) CROSSREFS Cf. A259542. Sequence in context: A240937 A178054 A195453 * A256632 A201280 A248274 Adjacent sequences: A259540 A259541 A259542 * A259544 A259545 A259546 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jun 30 2015 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 5 02:30 EST 2022. Contains 358572 sequences. (Running on oeis4.)