A169957 - OEIS

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A169957

a(1) = 1, then a(n) is the smallest number such that a(a(n)) = 2n+1.

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

Yifan Xie, Table of n, a(n) for n = 1..10000 (first 499 terms from Charlie Neder)

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 A325390 A296365