login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078107 Numbers n such that it is not possible to arrange the numbers from 1 to n in a chain with adjacent links summing to a square. 3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 18, 19, 20, 21, 22, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

It seems certain, on account of the valences of the underlying graph, that necklaces exist for all larger n, but this may not yet have been proved.

The problem originated (for n = 15) with Bernardo Recamán Santos of Colombia. The problem for necklaces is due to Joe Kisenwether.

REFERENCES

Ed Pegg Jr and W. Edwin Clark have found necklaces (and hence chains) for n = 32 onwards up to 50 and for several larger numbers.

LINKS

Table of n, a(n) for n=1..20.

EXAMPLE

E.g., for 15, 16 or 17, use (16-)9-7-2-14-11-5-4-12-13-3-6-10-15-1-8(-17).

CROSSREFS

Cf. A071983, A071984, A090460, A090461.

Sequence in context: A247764 A302140 A039698 * A072089 A072088 A023768

Adjacent sequences:  A078104 A078105 A078106 * A078108 A078109 A078110

KEYWORD

nonn,fini,full

AUTHOR

R. K. Guy, Dec 06 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 25 05:19 EDT 2019. Contains 326318 sequences. (Running on oeis4.)