A260933 -id:A260933 - cp's OEIS frontend

A260936 Numbers m such that A260933(m) = m.

4, 10, 13, 16, 19, 22, 25, 27, 31, 34, 37, 40, 42, 45, 47, 49, 52, 55, 57, 58, 59, 60, 61, 62, 64, 66, 67, 70, 73, 76, 79, 80, 82, 84, 85, 87, 91, 94, 97, 100, 101, 102, 103, 104, 106, 108, 109, 110, 112, 115, 117, 118, 121, 124, 126, 129, 132, 136, 139, 142

Offset: 1

Reinhard Zumkeller, Aug 04 2015

nonn

A260933(a(n)) = a(n): fixed points of A260933.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A260933.

a260936 n = a260936_list !! (n-1)
a260936_list = [x | x <- [1..], a260933 x == x]

A260822 Lexicographically smallest permutation of the natural numbers, such that a(n)+n is a composite number and a(n) != n.

Original entry on oeis.org

3, 4, 1, 2, 7, 8, 5, 6, 11, 12, 9, 10, 14, 13, 17, 18, 15, 16, 20, 19, 23, 24, 21, 22, 26, 25, 28, 27, 31, 32, 29, 30, 35, 36, 33, 34, 38, 37, 41, 42, 39, 40, 44, 43, 46, 45, 48, 47, 50, 49, 53, 54, 51, 52, 56, 55, 58, 57, 60, 59, 62, 61, 65, 66, 63, 64, 68

Offset: 1

Reinhard Zumkeller, Aug 04 2015

nonn

The permutation is self-inverse: a(a(n)) = n;

by definition there are no fixed points.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for sequences that are permutations of the natural numbers

Cf. A010051, A002808, A260933.

import Data.List (delete)
a260822 n = a260822_list !! (n-1)
a260822_list = f 1 [1..] where
   f x zs = g zs where
     g (y:ys) = if y /= x && a010051' (x + y) == 0
                   then y : f (x + 1) (delete y zs) else g ys

cp's OEIS Frontend

A260936 Numbers m such that A260933(m) = m.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell