Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096680
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096680
%S A096680 112,115,116,117,119,124,125,126,127,128,129,130,133,175,176,177,178,
%T A096680 179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,
%U A096680 196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212
%N A096680 A card-arranging problem: values of n such that there exists more than 
               one permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a 
               cube for every i.
%e A096680 117 is in the sequence with permutations
%e A096680 (7,6,...,2,1,117,116,...,9,8) and
%e A096680 (26,25,...,2,1,98,97,...28,27,117,116,...,100,99)
%Y A096680 Cf. A006063, A073364, A095986, A097082, A097083.
%Y A096680 Sequence in context: A103849 A010032 A129947 this_sequence A109383 A036301 
               A117723
%Y A096680 Adjacent sequences: A096677 A096678 A096679 this_sequence A096681 A096682 
               A096683
%K A096680 nonn
%O A096680 1,1
%A A096680 Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 25 2004

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research