Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071984
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071984 Square loops: the number of circular permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square. +0
10
1, 1, 11, 57, 31, 20, 25, 50, 64, 464, 1062, 4337, 10091, 21931, 69623, 115913 (list; graph; listen)
OFFSET

32,3

COMMENT

It is unknown whether a circular permutation of the numbers 1 to n exists such that the sum of any two consecutive numbers is a cube.

According to Rivera's Puzzle 311, the smallest n for which a cubic loop exists is 473. - T. D. Noe (noe(AT)sspectra.com), Nov 26 2007

LINKS

Carlos Rivera, Puzzle 311: Sum to a cube

EXAMPLE

There is only one possible square loop of minimum length, which is: (32, 4, 21, 28, 8, 1, 15, 10, 26, 23, 2, 14, 22, 27, 9, 16, 20, 29, 7, 18, 31, 5, 11, 25, 24, 12, 13, 3, 6, 30, 19, 17) so a(32)=1.

CROSSREFS

Cf. A071983, A112663.

Sequence in context: A034264 A051946 A114030 this_sequence A101094 A014470 A048366

Adjacent sequences: A071981 A071982 A071983 this_sequence A071985 A071986 A071987

KEYWORD

nice,nonn

AUTHOR

William Rex Marshall (w.r.marshall(AT)actrix.co.nz), Jun 16 2002

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research