login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Concatenations of cyclic permutations of initial positive integers.
6

%I #79 Jul 01 2022 22:04:15

%S 1,12,21,123,231,312,1234,2341,3412,4123,12345,23451,34512,45123,

%T 51234,123456,234561,345612,456123,561234,612345,1234567,2345671,

%U 3456712,4567123,5671234,6712345,7123456

%N Concatenations of cyclic permutations of initial positive integers.

%C Entries are sorted numerically, so after a(45) = 912345678 we have a(46) = 10123456789 instead of a(46) = 12345678910. - _Giovanni Resta_, Mar 21 2017

%C From _Marco Ripà_, Apr 21 2022: (Start)

%C In 1996, Kenichiro Kashihara conjectured that there is no prime power of an integer (A093771) belonging to this sequence (disregarding the trivial case 1); a direct search from 12 to a(100128) has confirmed the conjecture up to 10^1035. There are no perfect powers among terms t which are permutations of 123_...(m - 1)_m for m == {2, 3, 5, 6} (mod 9). This is since 10 == 1 (mod 9) and also (1 + 0) == 1 (mod 9), so digit position has no effect. Hence, t == A134804(m) (mod 9). Now, if m is such that A134804(m) = {3, 6}, there is a lone factor of 3, which is not a perfect power (indeed).

%C Therefore, any perfect power in this sequence is necessarily congruent modulo 9 to 0 or 1.

%C (End)

%H John Cerkan, <a href="/A001292/b001292.txt">Table of n, a(n) for n = 1..10000</a>

%H Marco Ripà, <a href="https://doi.org/10.13140/RG.2.2.30313.77921/3">On some open problems concerning perfect powers</a>, ResearchGate (2022).

%H Florentin Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">Only Problems, Not Solutions!</a>, Unsolved Problem #16, p. 18.

%t Sort@ Flatten@ Table[ FromDigits[ Join @@ IntegerDigits /@ RotateLeft[Range[n], i - 1]], {n, 11}, {i, n}] (* _Giovanni Resta_, Mar 21 2017 *)

%o (Python)

%o from itertools import count, islice

%o def A001292gen():

%o s = []

%o for i in count(1):

%o s.append(str(i))

%o yield from sorted(int("".join(s[j:]+s[:j])) for j in range(i))

%o print(list(islice(A001292gen(), 46))) # _Michael S. Branicky_, Jul 01 2022

%Y Cf. A093771, A134804, A352991.

%K nonn,base

%O 1,2

%A R. Muller