Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117412
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117412 Sum of the interior angles of an n-sided polygon, in gradians. +0
1
200, 400, 600, 800, 1000, 1200, 1400, 1600, 1800, 2000, 2200, 2400, 2600, 2800, 3000, 3200, 3400, 3600, 3800, 4000, 4200, 4400, 4600, 4800, 5000, 5200, 5400, 5600, 5800, 6000, 6200, 6400, 6600, 6800, 7000, 7200, 7400, 7600, 7800, 8000, 8200, 8400, 8600 (list; graph; listen)
OFFSET

0,1

REFERENCES

Eric Weisstein. "Gradian." http://mathworld.wolfram.com/Gradian.html

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=(n-2)*200 for n>=3

CROSSREFS

Sequence in context: A078492 A166256 A004966 this_sequence A109632 A129641 A035747

Adjacent sequences: A117409 A117410 A117411 this_sequence A117413 A117414 A117415

KEYWORD

base,easy,nonn

AUTHOR

Luc Stevens (lms022(AT)yahoo.com), Apr 25 2006

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 18 09:28 EDT 2010. Contains 173524 sequences.


AT&T Labs Research