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”).
%I #14 Jun 25 2023 20:36:12
%S 0,1,2,3,4,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,
%T 45,47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,
%U 91,93,95,97,99,101,103,105,107,109,111,113,115,117,119,121,123,125,127,129,131
%N 0, 2, 4 and the odd numbers.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2, -1).
%F G.f.: x(1-x^10)/((1-x)^2(1-x^5)). - _Paul Barry_, Aug 11 2006
%F Euler transform of length 10 sequence [ 2, 0, 0, 0, 1, 0, 0, 0, 0, -1]. - _Michael Somos_, Sep 06 2006
%t Sort[Join[{0,2,4},Range[1,201,2]]] (* _Harvey P. Dale_, Jan 16 2014 *)
%o (PARI) {a(n) = if( n<1, 0, n + (n>5) * (n-5))}; /* _Michael Somos_, Sep 06 2006 */
%Y Cf. A004281.
%K easy,nonn
%O 0,3
%A _N. J. A. Sloane_