login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A117412
Sum of the interior angles of an n-sided polygon, in gradians.
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
OFFSET
3,1
LINKS
Tanya Khovanova, Recursive Sequences
Eric Weisstein's World of Mathematics, Gradian.
FORMULA
a(n) = 200*(n-2) for n >= 3.
From G. C. Greubel, Sep 07 2022: (Start)
a(n) = 40*A008587(n-2).
G.f.: 200*x^3/(1-x)^2.
E.g.f.: 200*(2 + x - (2 - x)*exp(x)). (End)
MATHEMATICA
200*(Range[3, 50] -2) (* G. C. Greubel, Sep 07 2022 *)
PROG
(Magma) [200*(n-2): n in [3..50]]; // G. C. Greubel, Sep 07 2022
(SageMath) [200*(n-2) for n in (3..50)] # G. C. Greubel, Sep 07 2022
CROSSREFS
Cf. A008587.
Sequence in context: A166256 A252059 A004966 * A109632 A258921 A258918
KEYWORD
easy,nonn
AUTHOR
Luc Stevens (lms022(AT)yahoo.com), Apr 25 2006
STATUS
approved