|
Search: id:A096680
|
|
|
| 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. |
|
+0
4
|
|
| 112, 115, 116, 117, 119, 124, 125, 126, 127, 128, 129, 130, 133, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
117 is in the sequence with permutations
(7,6,...,2,1,117,116,...,9,8) and
(26,25,...,2,1,98,97,...28,27,117,116,...,100,99)
|
|
CROSSREFS
|
Cf. A006063, A073364, A095986, A097082, A097083.
Sequence in context: A103849 A010032 A129947 this_sequence A109383 A036301 A117723
Adjacent sequences: A096677 A096678 A096679 this_sequence A096681 A096682 A096683
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 25 2004
|
|
|
Search completed in 0.002 seconds
|
