Recursively Rotated Possible Permutation

[Hugo Pfoertner]

Leroy Quet wrote:

[...]

submitted
http://www.research.att.com/projects/OEIS?Anum=A098003

> 
> Hugo Pfoertner wrote:
> >
> >and the inverse
> >
> >  1   4   2   3  13   7   5   6  10   40   8   9  22  16  11
> > 12  19  31  14  15 121  25  17  18   28  67  20  21  49  34
> > 23  24  37  58  26  27  94  43  29   30  46 364  32  33  76
> > 52  35  36  55  85  38  39 202  61   41  42  64 148  44  45
> >103  70  47  48  73 112  50  51 175   79  53  54  82 283  56
> > 57 130  88  59  60  91 139  62  63 1093  97  65  66 100 229
> > 68  69 157 106  71  72 109 166  74   75 256 115  77  78 118
> >607  80  81 184 124  83  84 127 193   86  87 445 133  89  90
> >136 310  92  93 211 142  95  96 145  220  98  99 337 151 101
> >102 154 526 104 105 238 160 107 108  163 247 110 111 850 169
> >
[...]

Shall I submit the inverse? Or does superseeker always find inverses of
permutations?
 
> 
> Hmmm... I wonder now about any patterns when the sequence is taken mod m
> (for other m's besides 10).
> 
> thanks,
> Leroy Quet

Keith Ramsay has posted an exhaustive analysis of this sequence in the
newsgroup sci.math, see:

http://mathforum.org/discuss/sci.math/m/632610/632760

Hugo Pfoertner