This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A169957 a(1) = 1, then a(n) is the smallest number such that a(a(n)) = 2n+1. 4
 1, 3, 5, 6, 7, 9, 11, 10, 13, 17, 15, 14, 19, 25, 23, 18, 21, 33, 27, 22, 35, 41, 31, 26, 29, 49, 39, 30, 51, 57, 47, 34, 37, 65, 43, 38, 67, 73, 55, 42, 45, 81, 71, 46, 83, 89, 63, 50, 53, 97, 59, 54, 99, 105, 79, 58, 61, 113, 103, 62, 115 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Original name was "Similar to A079905, but without the 'monotonically increasing sequence' condition." LINKS Charlie Neder, Table of n, a(n) for n = 1..499 FORMULA a(1) = 1, a(2) = 3, a(4k) = 4k + 2, all other terms follow from the criterion defining the sequence. - Charlie Neder, Dec 21 2018 CROSSREFS Cf. A080653, A079905, A169956. Sequence in context: A284555 A031948 A247523 * A165712 A296365 A291166 Adjacent sequences:  A169954 A169955 A169956 * A169958 A169959 A169960 KEYWORD nonn AUTHOR Eric Angelini, Aug 02 2010 EXTENSIONS a(25)-a(61) from Charlie Neder, Dec 21 2018 Name changed by Charlie Neder, Dec 22 2018 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 20 04:43 EST 2019. Contains 319323 sequences. (Running on oeis4.)