A057064 - OEIS

A057064

Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...,s(n) fixed and forward-cyclically permuting every n consecutive terms thereafter; apply P(2) to 1,2,3,... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. The limit of PS(n) is A057064.

1, 2, 4, 5, 8, 7, 11, 9, 17, 16, 22, 13, 23, 15, 28, 29, 37, 19, 34, 21, 44, 36, 40, 25, 54, 35, 46, 47, 51, 31, 67, 33, 79, 53, 58, 56, 82, 39, 64, 60, 89, 43, 87, 45, 97, 88, 76, 49, 120, 65, 112, 77, 102, 55, 104, 80, 145, 84, 94, 61, 142, 63, 100, 114, 174

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

It appears that this is not a permutation of the integers: 3, 6, 10, 12, 14, 18, 20, 24, ... are not terms. - Michel Marcus, Feb 19 2016

Indeed, see the first formula here and the first comment in A069829. - Mikhail Kurkov, Mar 08 2023

LINKS

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

FORMULA

a(n) = A057032(n-1) + 1 for n > 1. - Sean A. Irvine, May 19 2022

EXAMPLE

PS(2) begins with 1,2,4,3,6,5,8; PS(3) with 1,2,4,5,3,6,10; PS(4) with 1,2,4,5,8,3,6.

PROG

(PARI) get(v, iv) = if (iv > #v, 0, v[iv]);

fcp(nbn, nbp, startv, v) = {w = vector(nbn); for (k=1, nbn, j = k % nbp; if (j == 1, jv = startv+k+nbp-2, jv = startv+k-2); w[k] = get(v, jv); ); w; }

lista(nn) = {v = vector(nn, n, n); print1(v[1], ", ", v[2], ", "); startv = 3; for (n=3, nn, w = fcp(nn-n+1, n-1, startv, v); startv = 2; if (w[1] == 0, break); print1(w[1], ", "); v = w; ); } \\ Michel Marcus, Feb 19 2016

CROSSREFS

Cf. A007062, A057030, A057032, A057033, A057063, A069829.

Sequence in context: A057168 A087711 A123128 * A340781 A328105 A144831

Adjacent sequences: A057061 A057062 A057063 * A057065 A057066 A057067

KEYWORD

nonn

AUTHOR

Clark Kimberling, Aug 01 2000

EXTENSIONS

More terms from Michel Marcus, Feb 19 2016

STATUS

approved