A065194 Limits of the recursion b(i+1)=B_[i](b(i)), where b(1)=n and B_[k+1](j) = B_[k](j), if j <= k; B_[k+1](j) = B_[k](j) + k, if j < k and (j mod 2k) >= k; B_[k+1](j) = B_[k](j) - k, if j < k and (j mod 2k) < k. Set a(n)=0 if b tends to infinity.

1, 10, 4, 2, 5, 35, 24, 3, 20, 14, 9, 19, 12, 39, 13, 6, 104, 7, 8, 79, 145, 27, 60, 15, 45, 31, 144, 22, 16, 4339, 28, 46, 25, 70, 29, 479, 17, 2170, 40, 11, 325, 114, 85, 30, 32, 75, 36, 43, 44, 18, 300, 235, 49, 135, 704, 214, 33, 54, 9160, 26, 80, 91, 21, 42, 160

Offset

1,2

Comments

If zero never appears in a, then the sequence would be permutation of the naturals and A065191 would be its inverse.

Links

Table of n, a(n) for n=1..65.

Crossrefs

Cf. A065191, A065192, A065193, A065195, A065196, A065197.

Sequence in context: A371918 A177390 A082961 * A113315 A081986 A063566

Adjacent sequences: A065191 A065192 A065193 * A065195 A065196 A065197

Keyword

nice,nonn

Author

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Oct 19 2001

Status

approved