Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080866 Number of equal shortest edges in the solutions of the Tammes' problem. +0
2
1, 3, 6, 6, 12, 12, 16, 18, 19, 25, 30, 24, 28, 30, 32, 34, 34, 34, 39 (list; graph; listen)
OFFSET

2,2

COMMENT

Sequence terms for n>12 are conjectured. A conjectured continuation of the sequence starting with n=21 would be: 40 42 43 60 48 46 52 52 54 63 60 66 66 68 66 72 66 72 76 78 81 85 82 88 84 91 89 120 96 102 In the visualization given at the link the shortest edges are those drawn as golden color rods.

REFERENCES

See under A080865

LINKS

Hugo Pfoertner, Arrangement of points on a sphere. Visualization of the best known solutions of the Tammes' problem.

Hugo Pfoertner, Table of edge lengths.

CROSSREFS

Cf. A080865.

Sequence in context: A066297 A160713 A012212 this_sequence A066393 A127777 A119306

Adjacent sequences: A080863 A080864 A080865 this_sequence A080867 A080868 A080869

KEYWORD

hard,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Feb 21 2003

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research