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.
%I A206545 #19 Sep 21 2018 10:58:20
%S A206545 1,3,5,7,9,11,13,15,15,13,11,9,7,5,3,1,1,3,5,7,9,11,13,15,15,13,11,9,
%T A206545 7,5,3,1,1,3,5,7,9,11,13,15,15,13,11,9,7,5,3,1,1,3,5,7,9,11,13,15,15,
%U A206545 13,11,9,7,5,3,1,1,3,5,7,9,11,13,15,15,13,11,9,7,5,3,1
%N A206545 Period length 16: repeat 1, 3, 5, 7, 9, 11, 13, 15, 15, 13, 11, 9, 7, 5, 3, 1.
%C A206545 For general Modd n see a comment on A203571. This sequence gives the Modd 17 residues of the odd numbers not divisible by 17, which are given in A204458.
%C A206545 The underlying periodic sequence with period length 34 is periodic (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 0, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1). This sequence with offset 0 is called P_17 or Modd17.
%F A206545 a(n) = A204458(n) (Modd 17) := Modd17(A204458(n)), n>=1, with the periodic sequence Modd17, with period length 34, defined in the comment section.
%F A206545 O.g.f.: x*(1+x^15+3*x*(1+x^13)+5*x^2*(1+x^11)+7*x^3*(1+x^9)+9*x^4*(1+x^7)+11*x^5*(1+x^5)+ 13*x^6*(1+x^3)+15*x^7*(1+x))/(1-x^16) = x*(1+x)^2*(1+x^2)*(1+x^4)/((1+x^8)*(1-x)).
%e A206545 Residue Modd 17 of the positive odd numbers not divisible by 17:
%e A206545 A204458: 1, 3, 5, 7, 9, 11, 13, 15, 19, 21, 23, 25, 27, 29,...
%e A206545 Modd 17: 1, 3, 5, 7, 9, 11, 13, 15, 15, 13, 11, 9, 7, 5,...
%t A206545 PadRight[{},120,Join[Range[1,15,2],Range[15,1,-2]]] (* _Harvey P. Dale_, Sep 21 2018 *)
%Y A206545 Cf. A000012 (Modd 3), A084101 (Modd 5), A110551 (Modd 7), A206543 (Modd 11), A206544 (Modd 13).
%K A206545 nonn,easy
%O A206545 1,2
%A A206545 _Wolfdieter Lang_, Feb 09 2012