login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A265902 Self-inverse permutation of nonnegative integers: a(n) = A263273(A263272(A263273(n))). 3

%I #14 Jan 12 2016 00:39:00

%S 0,1,2,3,4,19,6,7,8,9,10,55,12,13,58,57,64,73,18,5,20,21,22,25,24,23,

%T 26,27,28,163,30,37,172,165,190,217,36,31,166,39,40,175,174,193,220,

%U 171,46,181,192,199,226,219,208,235,54,11,56,15,14,59,60,65,74,63,16,61,66,67,76,75,70

%N Self-inverse permutation of nonnegative integers: a(n) = A263273(A263272(A263273(n))).

%H Antti Karttunen, <a href="/A265902/b265902.txt">Table of n, a(n) for n = 0..6561</a>

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%F a(n) = A263273(A263272(A263273(n))).

%F As a composition of related permutations:

%F a(n) = A263273(A265351(n)).

%F a(n) = A265352(A263273(n)).

%F Other identities. For all n >= 0:

%F a(3*n) = 3*a(n).

%F A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.]

%t f[n_] := Block[{g, h}, g[x_] := x/3^IntegerExponent[x, 3]; h[x_] := x/g@ x; If[n == 0, 0, FromDigits[Reverse@ IntegerDigits[#, 3], 3] &@ g[n] h[n]]]; t = Table[f[2 n]/2, {n, 0, 1000}]; Table[f[t[[f@ n + 1]]], {n, 0, 83}] (* _Michael De Vlieger_, Jan 04 2016, after _Jean-François Alcover_ at A263273 *)

%o (Scheme) (define (A265902 n) (A263273 (A263272 (A263273 n))))

%Y Cf. A000035, A263272, A263273, A265351, A265352.

%Y Cf. also A265904, A266189.

%K nonn,base

%O 0,3

%A _Antti Karttunen_, Jan 02 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 13:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)