A209860 - 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

A209860

Fixed points of permutation A209861/A209862.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 17, 18, 29, 30, 31, 32, 33, 34, 61, 62, 63, 64, 65, 66, 73, 118, 125, 126, 127, 128, 129, 130, 148, 235, 253, 254, 255, 256, 257, 258, 274, 493, 509, 510, 511, 512, 513, 514, 651, 689, 710, 825, 846, 884, 1021, 1022, 1023, 1024, 1025, 1026, 1097, 1974, 2045, 2046, 2047, 2048, 2049

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

Conjecture: for every a(n), also A054429(a(n)) is in the sequence. Conversely, if i is not in the sequence, then neither is A054429(i).

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..171

FORMULA

Those i, for which A209861(i)=i, or equally A209862(i)=i.

CROSSREFS

A209863 gives the number of these fixed points in each range [2^(n-1),(2^n)-1].

Sequence in context: A247812 A050724 A336813 * A287513 A194403 A305707

Adjacent sequences: A209857 A209858 A209859 * A209861 A209862 A209863

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 24 2012

STATUS

approved