1,2

For n>1 a(n) is prime because if m is a composite number then T_m(m)=m so in such case T_m can not be a cyclic permutation. There is no further term up to prime(4420). - Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Jun 29 2005

If m>3 & m=prime(k) then for n=1,2,...,m T_m(n) are respectively prime(1),prime(2),...,prime(k),1,4,...,m-1.

31 is in the sequence because T_31=(1, 2, 3, 5, 11, 31, 30, 28, 26, 24, 21, 16, 9, 23, 20, 15, 8, 19, 14, 6, 13, 4, 7, 17, 10, 29, 27, 25, 22, 18, 12) is a cyclic permutation.

f[n_] := (a = Table[Prime[k], {k, PrimePi[n]}]; b = Complement[ Range[n], a]; c = Join[a, b]); d[n_, m_] := f[n][[m]]; g[r_]:= (v = {1}; d[m_] := d[Prime[r], m]; For[t = 1, ! MemberQ[v, d[v[[ -1]]]] && t < Prime[r], v = Append[ v, d[v[[ -1]]]]; t++ ]; t); w = {1}; Do[If[Prime[r] == g[r], w = Append[w, Prime[r]]; Print[w]], {r, 4420}] (Firoozbakht)

Cf. A018252.

Cf. A108516, A108517.

Adjacent sequences: A108512 A108513 A108514 this_sequence A108516 A108517 A108518

Sequence in context: A072536 A087592 A038879 this_sequence A041519 A060434 A072999

more,nonn

Mehdi Khorrami (f.firoozbakht(AT)math.ui.ac.ir), Jun 27 2005

More terms from Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Jun 29 2005