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!)
A065652 a(0) = 0 and a(n+1) = if a(n) - 1 is new and > 0 then a(n) - 1 else a(n)*a(n) + 1 for n >= 0. 2

%I #7 Mar 30 2012 18:50:19

%S 0,1,2,5,4,3,10,9,8,7,6,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,

%T 22,21,20,19,18,17,16,15,14,13,12,11,122,121,120,119,118,117,116,115,

%U 114,113,112,111,110,109,108,107,106,105,104,103,102,101,100,99,98,97

%N a(0) = 0 and a(n+1) = if a(n) - 1 is new and > 0 then a(n) - 1 else a(n)*a(n) + 1 for n >= 0.

%C a(a(n)) = n: a self-inverse permutation of the natural numbers. a(x) = x iff x = A065654(k) for some k.

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

%F a(A065653(k) + j) = A065653(k+1) - 1 - j for k >= 0 and 0 <= j < A065653(k+1) - A065653(k).

%Y Cf. A065653, A065654

%K nonn

%O 0,3

%A _Reinhard Zumkeller_, Nov 10 2001

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 April 24 16:56 EDT 2024. Contains 371962 sequences. (Running on oeis4.)