|
Search: id:A163793
|
|
|
| A163793 |
|
a(n) is the n-th J_13-prime (Josephus_13 prime) Place the numbers 1..N (N>=2) on a circle and cyclicly mark the 13th unmarked number until all N umbers are marked. The order in which the N numbers are marked defines a permutation; N is a J_13-prime if this permutation consists of a single cycle of length N. |
|
+0
3
|
|
| 5, 57, 117, 187, 251, 273, 275, 665, 2511, 40393, 48615, 755921, 970037
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
There are 13 J_13-primes in the interval 2..1000000 only. No formula is known; the J_13-primes have been found by exhaustive search.
|
|
REFERENCES
|
R. L. Graham, D.E. Knuth & O. Patashnik, Concrete Mathematics (1989), Addison-Wesley, Reading, MA. Sections 1.3 & 3.3.
|
|
LINKS
|
P. R. J. Asveld, Permuting Operations on Strings - Their Permutations and Their Primes (2009), TR-CTIT-09-26, Dept. of CS, Twente University of Technology, Enschede, The Netherlands.
|
|
EXAMPLE
|
All J_13-primes are odd.
|
|
CROSSREFS
|
A163782 through A163792 for J_2- through J_12-primes. A163794 through A163800 for J_14- through J_20-primes.
Sequence in context: A006293 A132618 A060080 this_sequence A076455 A000362 A103047
Adjacent sequences: A163790 A163791 A163792 this_sequence A163794 A163795 A163796
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
P. R. J. Asveld (infprja(AT)cs.utwente.nl), Aug 04 2009
|
|
|
Search completed in 0.002 seconds
|
