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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259570 Smallest m such that A259565(m) = 2*n-1. 2
 1, 2, 4, 3, 5, 6, 8, 7, 9, 12, 10, 11, 13, 14, 16, 15, 17, 18, 20, 19, 21, 22, 24, 25, 23, 27, 30, 26, 29, 28, 31, 32, 34, 33, 35, 36, 38, 37, 40, 41, 39, 44, 42, 43, 45, 48, 46, 47, 49, 51, 53, 52, 50, 56, 54, 55, 57, 58, 60, 61, 59, 65, 62, 67, 63, 64, 68 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Sequence is a permutation of the natural numbers iff A259565 is a permutation of the odd numbers; A259565(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) a259570 = (+ 1) . fromJust . (`elemIndex` a259565_list) . subtract 1 . (* 2) CROSSREFS Cf. A259565. Sequence in context: A107897 A133256 A338500 * A334672 A095690 A094870 Adjacent sequences:  A259567 A259568 A259569 * A259571 A259572 A259573 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 May 18 23:31 EDT 2022. Contains 353826 sequences. (Running on oeis4.)