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.

A010674 Period 2: repeat (0,3).

This page as a plain text file.
%I A010674 #48 Jan 16 2024 01:49:00
%S A010674 0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,
%T A010674 0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,
%U A010674 0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0,3,0
%N A010674 Period 2: repeat (0,3).
%C A010674 Also decimal expansion of 1/33 = .030303030...
%H A010674 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F A010674 a(n) = (3/2)*(1 - (-1)^n) = 3*(n mod 2). - _Paolo P. Lava_, Oct 20 2006
%F A010674 a(n) = A010698(n)/2 - 1. - _Martin Ettl_, Nov 11 2012
%F A010674 a(n) = 2^(1 - (-1)^n) - 1. - _Bruno Berselli_, Dec 29 2015
%F A010674 From _Chai Wah Wu_, Jun 04 2016: (Start)
%F A010674 a(n) = a(n-2) for n >= 2.
%F A010674 G.f.: 3*x/(1 - x^2). (End)
%F A010674 E.g.f.: 3*sinh(x). - _Ilya Gutkovskiy_, Jun 04 2016
%t A010674 3Mod[Range[0, 99], 2] (* _Alonso del Arte_, Mar 25 2020 *)
%o A010674 (PARI) a(n)=n%2*3 \\ _Charles R Greathouse IV_, Nov 20 2011
%o A010674 (Maxima) makelist(if evenp(n) then 0 else 3, n, 0, 30); /* _Martin Ettl_, Nov 09 2012 */
%o A010674 (Magma) &cat [[0,3]^^50]; // _Bruno Berselli_, Dec 29 2015
%o A010674 (Scala) (0 to 99).map(_ % 2 * 3) // _Alonso del Arte_, Mar 25 2020
%Y A010674 Cf. A010680 (1/11), A010695 (2^(1 - (-1)^n) + 1).
%K A010674 nonn,cons,easy
%O A010674 0,2
%A A010674 _N. J. A. Sloane_
%E A010674 More terms from _Paolo P. Lava_, Oct 20 2006