login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096905 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 fourth power for every i. 1

%I #9 Mar 03 2014 01:39:58

%S 15,65,80,175,190,240,255,369,384,434,449,544,559,609,624,671,686,736,

%T 751,846,861,911,926,1040,1055,1105,1120,1215,1230,1235,1250,1260,

%U 1270,1275,1280,1285,1290,1295,1300,1305,1315,1345,1360,1474,1489,1519,1529,1534,1539

%N 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 fourth power for every i.

%C 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

%Y Cf. A006063, A096906.

%K nonn

%O 1,1

%A _Ray Chandler_, Aug 02 2004

%E More terms from _David Wasserman_, Nov 21 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 12:48 EDT 2024. Contains 371942 sequences. (Running on oeis4.)