Least count k that deletes the alternate (odd) numbers in the Josephus problem for a circle of numbers 1, 2, 3, ... 2*n, leaving the even numbers undeleted.
A198791
Least count k that deletes the alternate (odd) numbers in the Josephus problem for a circle of numbers 1, 2, 3, ... 2*n, leaving the even numbers undeleted.
Terms
- a(0) =1a(1) =5a(2) =19a(3) =27a(4) =87a(5) =989a(6) =3119a(7) =5399a(8) =8189a(9) =99663a(10) =57455a(11) =222397a(12) =2603047a(13) =8476649a(14) =117917347a(15) =290190179a(16) =360064247a(17) =1344262919a(18) =3181391639a(19) =39179386959a(20) =204692414215a(21) =165424388219a(24) =594630799853
External references
- oeis: A198791