A053661 For n > 1: if n is present, 2n is not.
1, 2, 3, 5, 7, 8, 9, 11, 12, 13, 15, 17, 19, 20, 21, 23, 25, 27, 28, 29, 31, 32, 33, 35, 36, 37, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 53, 55, 57, 59, 60, 61, 63, 65, 67, 68, 69, 71, 73, 75, 76, 77, 79, 80, 81, 83, 84, 85, 87, 89, 91, 92, 93, 95, 97, 99, 100, 101, 103, 105
Offset: 1
Links
- Robert Israel, Table of n, a(n) for n = 1..10000
- Aviezri S. Fraenkel, The vile, dopey, evil and odious game players, Discrete Math. 312 (2012), no. 1, 42-46.
Programs
-
Haskell
a053661 n = a053661_list !! (n-1) a053661_list = filter (> 0) a175880_list -- Reinhard Zumkeller, Feb 09 2011
-
Maple
N:= 1000: # to get all terms <= N sort([1,seq(2^(2*i+1),i=0..(ilog2(N)-1)/2), seq(seq(2^(2*i)*(2*j+1),j=1..(N/2^(2*i)-1)/2),i=0..ilog2(N)/2)]); # Robert Israel, Jul 24 2015
-
Mathematica
Clear[T]; nn = 105; T[n_, k_] := T[n, k] = If[n < 1 || k < 1, 0, If[n == 1 || k == 1, 1, If[k > n, T[k, n], If[n > k, T[k, Mod[n, k, 1]], -Product[T[n, i], {i, n - 1}]]]]]; DeleteCases[Table[If[T[n, n] == -1, n, ""], {n, 1, nn}], ""] (* Mats Granvik, Aug 25 2012 *)
Extensions
More terms from James Sellers, Feb 22 2000
Comments