This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A096680 #3 Mar 30 2012 17:29:16 %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. %K A096680 nonn %O A096680 1,1 %A A096680 _Ray Chandler_, Jul 25 2004