A276581 -id:A276581 - cp's OEIS frontend

A276582 Simple self-inverse permutation of natural numbers: after a(0)=0, list each block of A261224(n) numbers in reverse order, from A261222(n) to A261223(1+n).

0, 1, 3, 2, 5, 4, 8, 7, 6, 11, 10, 9, 14, 13, 12, 18, 17, 16, 15, 23, 22, 21, 20, 19, 28, 27, 26, 25, 24, 34, 33, 32, 31, 30, 29, 40, 39, 38, 37, 36, 35, 47, 46, 45, 44, 43, 42, 41, 54, 53, 52, 51, 50, 49, 48, 61, 60, 59, 58, 57, 56, 55, 69, 68, 67, 66, 65, 64, 63, 62, 77, 76, 75, 74, 73, 72, 71, 70, 86, 85, 84, 83, 82, 81, 80, 79, 78

Offset: 0

Antti Karttunen, Sep 07 2016

nonn

Maps between A276583 and A276584.

Antti Karttunen, Table of n, a(n) for n = 0..9996
Index entries for sequences that are permutations of the natural numbers

Cf. A261222, A261223, A261224, A276581, A276583, A276584.

(define (A276582 n) (if (zero? n) n (+ (- (A261223 (+ 1 (A276581 n))) n) (A261222 (A276581 n)))))

a(0)=0; for n >= 1, a(n) = (A261223(1+A276581(n))- n)+A261222(A276581(n)).

A276571 After a(0)=0, each n occurs A260734(n) times.

Original entry on oeis.org

0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15

Offset: 0

Antti Karttunen, Sep 07 2016

nonn

Auxiliary function for computing A276572 & A276573.

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

Cf. A260733, A260734, A276572, A276573.

Cf. also A276581.

Table[Table[n, {Length[#] - 1 &@ NestWhileList[# - (If[First@ # > 0, 1, Length[ First@ Split@ #] + 1] &@ SquaresR[Range@ 4, #]) &, ((n + 1)^2) - 1, # != (n^2) - 1 &]}], {n, 15}] // Flatten (* Michael De Vlieger, Sep 08 2016 *)

(define (A276571 n) (let loop ((k 0)) (if (>= (A260733 (+ 1 k)) n) k (loop (+ 1 k)))))

cp's OEIS Frontend

A276582 Simple self-inverse permutation of natural numbers: after a(0)=0, list each block of A261224(n) numbers in reverse order, from A261222(n) to A261223(1+n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula