A Permutation Based On Largest Odd Divisor

David Wilson davidwwilson at comcast.net
Sat Dec 25 09:02:58 CET 2004

My argument can be generalized:

If s: Z+ -> Z+ has s(n) = 1 infinitely often, then the sequence
a: Z+ -> Z+ defined by

a(n) = s(n)th smallest element of Z+ not appearing among a(1)..a(n-1).

will be a permutation of the integers.

More information about the SeqFan mailing list