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”).
%I #9 Jun 22 2024 15:06:11
%S 142857,285714,142857142857,285714285714,142857142857142857,
%T 285714285714285714,142857142857142857142857,285714285714285714285714,
%U 142857142857142857142857142857,285714285714285714285714285714,142857142857142857142857142857142857
%N 3-transposable numbers.
%C A positive integer x is called k-transposable if when the leftmost digit is moved into the units place, the result is equal to kx.
%C A number is 1-transposable iff its digits are all the same.
%C Kahan shows that if k>1 then k must be 3 and the only solutions are concatenations of copies of either 142857 or 285714, as given in this sequence, which therefore lists all k-transposable numbers with k>1.
%H N. J. A. Sloane, <a href="/A144504/b144504.txt">Table of n, a(n) for n = 1..20</a>
%H S. Kahan, <a href="http://www.jstor.org/stable/2689877">k-transposable integers</a>, Math. Mag., 49 (1976), 27-28.
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_, Dec 14 2008