

A096905


A cardarranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fourth power for every i.


1



15, 65, 80, 175, 190, 240, 255, 369, 384, 434, 449, 544, 559, 609, 624, 671, 686, 736, 751, 846, 861, 911, 926, 1040, 1055, 1105, 1120, 1215, 1230, 1235, 1250, 1260, 1270, 1275, 1280, 1285, 1290, 1295, 1300, 1305, 1315, 1345, 1360, 1474, 1489, 1519, 1529, 1534, 1539
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

1280 is the first n that has multiple solutions; it has 32. 1285 has 1024 solutions. 1290 has 248832 solutions.  David Wasserman, Dec 19 2007


LINKS



CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



