|
%I #24 Jul 29 2022 21:37:38
%S 3,5,27,89,1139,1219,1921,2155,5775,9047,12437,78785,105909,197559,
%T 1062657
%N a(n) is the n-th J_3-prime (Josephus_3 prime).
%C Place the numbers 1..N (N>=2) on a circle and cyclicly mark the 3rd unmarked number until all N numbers are marked. The order in which the N numbers are marked defines a permutation; N is a J_3-prime if this permutation consists of a single cycle of length N.
%C There are 14 J_3-primes in the interval 2..1000000 only. No formula is known; the J_3-primes have been found by exhaustive search.
%C a(16) > 3*10^6. - _Bert Dobbelaere_, Apr 20 2019
%D R. L. Graham, D. E. Knuth & O. Patashnik, Concrete Mathematics (1989), Addison-Wesley, Reading, MA. Sections 1.3 & 3.3.
%H P. R. J. Asveld, <a href="http://eprints.eemcs.utwente.nl/20685/">Permuting operations on strings and the distribution of their prime numbers</a> (2011), TR-CTIT-11-24, Dept. of CS, Twente University of Technology, Enschede, The Netherlands.
%H P. R. J. Asveld, <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.1682">Permuting Operations on Strings-Their Permutations and Their Primes</a>, Twente University of Technology.
%H P. R. J. Asveld, <a href="http://dx.doi.org/10.1016/j.dam.2011.07.019">Permuting Operations on Strings and Their Relation to Prime Numbers</a> Discrete Applied Mathematics 159 (2011) 1915-1932.
%H <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a>
%e All J_3-primes are odd.
%Y A163782 for J_2-primes. A163784 through A163800 for J_4- through J_20-primes.
%K nonn,more
%O 1,1
%A _Peter R. J. Asveld_, Aug 05 2009
%E a(15) from _Bert Dobbelaere_, Apr 20 2019
| 