%I A006063 M4361
%S A006063 7,19,26,37,44,56,63,66,68,80,82,85,87,98,100,103,105,110,112,115,116,
%T A006063 117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,
%U A006063 135,147,149,150,151,152,155,156,159,171,173,174,175,176,177,178,179
%N A006063 A card-arranging problem: values of n such that there exists a permutation 
               p_1, ..., p_n of 1, ..., n such that i + p_i is a cube for every 
               i.
%C A006063 Apparently Gardner (1975) quotes Papaikonomou as showing that there can 
               be at most one solution for a given n. However, this is incorrect: 
               see A096680 for n values with more than one such permutation. (Ray 
               Chandler)
%D A006063 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006063 M. Gardner, Mathematical Games column, Scientific American, Mar 1975.
%D A006063 M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, 
               NY, 1988, p. 81.
%Y A006063 Cf. A095986 (for squares), A096680.
%Y A006063 Sequence in context: A127633 A055246 A003282 this_sequence A038593 A014439 
               A117609
%Y A006063 Adjacent sequences: A006060 A006061 A006062 this_sequence A006064 A006065 
               A006066
%K A006063 nonn
%O A006063 1,1
%A A006063 N. J. A. Sloane (njas(AT)research.att.com).
%E A006063 Entry revised Jul 18 2004 based on comments from Franklin T. Adams-Watters.
%E A006063 a(8) and later terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), 
               Jul 26 2004