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 A256676 #11 Sep 08 2022 08:46:11
%S A256676 1,3,7,4,3,4,7,3,1,1,3,7,4,3,4,7,3,1,1,3,7,4,3,4,7,3,1,1,3,7,4,3,4,7,
%T A256676 3,1,1,3,7,4,3,4,7,3,1,1,3,7,4,3,4,7,3,1,1,3,7,4,3,4,7,3,1,1,3,7,4,3,
%U A256676 4,7,3,1,1,3,7,4,3,4,7,3,1,1,3,7,4,3
%N A256676 Digital roots of centered 11-gonal numbers (A069125).
%C A256676 The sequence is periodic with period 9.
%H A256676 Colin Barker, <a href="/A256676/b256676.txt">Table of n, a(n) for n = 1..1000</a>
%H A256676 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A256676 a(n) = A010888(A069125(n)).
%F A256676 a(n) = a(n-9).
%F A256676 G.f.: -x*(x^8+3*x^7+7*x^6+4*x^5+3*x^4+4*x^3+7*x^2+3*x+1) / ((x-1)*(x^2+x+1)*(x^6+x^3+1)).
%e A256676 a(3) = 7 because the 3rd centered 11-gonal number is 34, the digital root of which is 7.
%t A256676 PadRight[{}, 100, {1, 3, 7, 4, 3, 4, 7, 3, 1}] (* _Vincenzo Librandi_, Apr 08 2015 *)
%t A256676 LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 1},{1, 3, 7, 4, 3, 4, 7, 3, 1},86] (* _Ray Chandler_, Aug 26 2015 *)
%o A256676 (PARI) m=11; vector(200, n, (m*n*(n-1)/2)%9+1)
%o A256676 (Magma) &cat[[1,3,7,4,3,4,7,3,1]: n in [0..10] ]; // _Vincenzo Librandi_, Apr 08 2015
%Y A256676 Cf. A010888, A069125.
%K A256676 nonn,base,easy
%O A256676 1,2
%A A256676 _Colin Barker_, Apr 07 2015