A Permutation Based On Largest Odd Divisor
Hans Havermann
pxp at rogers.com
Sat Dec 25 04:05:23 CET 2004
Leroy Quet:
> %S A101319
> 1, 2, 3, 6, 7, 12, 8, 4, 5, 14, 17, 28, 18, 21, 35, 50, 40, 15, 30,
> 31, 51, 72, 23, 43, 66, 56, 20, 16, 9, 27, 54, 55, 87, 120, 38, 45,
> 79, 115, 153, 192, 13, ...
> %N A101319
> a(1) = 1; a(n) = (largest odd divisor of a(n-1))th lowest positive
> integer not yet in the sequence.
> Is this a permutation of the positive integers?
Just to note that in the first 50000 terms, the maximum term is 697616
at index 48568 and the smallest terms not yet encountered are: {225,
234, 302, 393, 439, 452, 497, 547, 602, ...}
More information about the SeqFan
mailing list