Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006063
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006063 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 cube for every i.
(Formerly M4361)
+0
7
7, 19, 26, 37, 44, 56, 63, 66, 68, 80, 82, 85, 87, 98, 100, 103, 105, 110, 112, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 135, 147, 149, 150, 151, 152, 155, 156, 159, 171, 173, 174, 175, 176, 177, 178, 179 (list; graph; listen)
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 20 13:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research