cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A010673 Period 2: repeat [0, 2].

This page as a plain text file.
%I A010673 #82 May 15 2025 11:42:06
%S A010673 0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,
%T A010673 0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,
%U A010673 0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0
%N A010673 Period 2: repeat [0, 2].
%C A010673 Euler number (or Euler characteristic) of (n+1)-sphere. - _Franz Vrabec_, Sep 07 2007
%C A010673 First differences of A109613. - _Reinhard Zumkeller_, Dec 05 2009
%C A010673 a(n) = Sum_{k=0..n-1} (-1)^k*N_k, for n >= 1, is Schläfli's generalization of Euler's formula for simply-connected n-dimensional polytopes. N_0 is the number of vertices, ..., N_{d-1} is the number of (d-1)-dimensional faces. See Coxeter's book for references, also for Poincaré's proof. - _Wolfdieter Lang_, Feb 09 2018
%C A010673 Decimal expansion of 2/99. - _R. J. Mathar_, May 15 2025
%D A010673 R. Carter, G. Segal, I. Macdonald, Lectures on Lie Groups and Lie Algebras, London Mathematical Society Student Texts 32, Cambridge University Press, 1995; see p. 68.
%D A010673 H. S. M. Coxeter, Regular Polytopes, third ed., Dover publications, New York, 1973, p. 165.
%H A010673 Muniru A Asiru, <a href="/A010673/b010673.txt">Table of n, a(n) for n = 0..1000</a>
%H A010673 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F A010673 a(n) = 1 - (-1)^n.
%F A010673 a(n) = 2*(n mod 2). - _Paolo P. Lava_, Oct 20 2006
%F A010673 G.f.: -2*x / ((x-1)*(1+x)). - _R. J. Mathar_, Apr 06 2011
%F A010673 E.g.f.: (exp(2*x) - 1)/exp(x). - _Elmo R. Oliveira_, Dec 19 2023
%p A010673 seq(op([0,2]),n=0..80); # _Muniru A Asiru_, Oct 26 2018
%t A010673 PadRight[{},120,{0,2}] (* or *) LinearRecurrence[{0,1},{0,2},120] (* _Harvey P. Dale_, May 29 2016 *)
%o A010673 (Maxima) makelist(if evenp(n) then 0 else 2, n, 0, 30); /* _Martin Ettl_, Nov 11 2012 */
%o A010673 (Maxima) makelist(concat(0,", ",2), n, 0, 40); /* _Bruno Berselli_, Nov 13 2012 */
%o A010673 (PARI) a(n)=1-(-1)^n \\ _Charles R Greathouse IV_, Oct 07 2015
%o A010673 (GAP) Flat(List([0..80],n->[0,2])); # _Muniru A Asiru_, Oct 26 2018
%Y A010673 Cf. A109613.
%K A010673 nonn,easy
%O A010673 0,2
%A A010673 _N. J. A. Sloane_