Numbers k for which the prime circle problem has a solution composed of disjoint subsets: the arrangement of numbers 1 through 2k around a circle is such that the sum of each pair of adjacent numbers is prime, the odd numbers are in order and the even numbers are in groups of decreasing sequences.
A072676
Numbers k for which the prime circle problem has a solution composed of disjoint subsets: the arrangement of numbers 1 through 2k around a circle is such that the sum of each pair of adjacent numbers is prime, the odd numbers are in order and the even numbers are in groups of decreasing sequences.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =4a(4) =5a(5) =6a(6) =7a(7) =8a(8) =9a(9) =10a(10) =11a(11) =12a(12) =13a(13) =14a(14) =15a(15) =16a(16) =18a(17) =19a(18) =20a(19) =21a(20) =22a(21) =24a(22) =25a(23) =26a(24) =27a(25) =28a(26) =29a(27) =30a(28) =31a(29) =33
External references
- oeis: A072676