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 A047407 #36 Sep 08 2022 08:44:57
%S A047407 0,4,6,8,12,14,16,20,22,24,28,30,32,36,38,40,44,46,48,52,54,56,60,62,
%T A047407 64,68,70,72,76,78,80,84,86,88,92,94,96,100,102,104,108,110,112,116,
%U A047407 118,120,124,126,128,132,134,136,140,142,144,148,150,152,156
%N A047407 Numbers that are congruent to {0, 4, 6} mod 8.
%H A047407 Vincenzo Librandi, <a href="/A047407/b047407.txt">Table of n, a(n) for n = 1..1000</a>
%H A047407 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1,-1).
%F A047407 From _R. J. Mathar_, Dec 05 2011: (Start)
%F A047407 a(n) = 2*A004772(n).
%F A047407 G.f.: 2*x^2*(2+x+x^2) / ((1+x+x^2)*(x-1)^2). (End)
%F A047407 From _Wesley Ivan Hurt_, Jun 10 2016: (Start)
%F A047407 a(n) = a(n-1) + a(n-3) - a(n-4) for n>4.
%F A047407 a(n) = 2*(12*n-9-2*sqrt(3)*sin(2*n*Pi/3))/9.
%F A047407 a(3k) = 8k-2, a(3k-1) = 8k-4, a(3k-2) = 8k-8. (End)
%F A047407 a(n) = 2*(n - 1 + floor((n + 1)/3)). - _Wolfdieter Lang_, Sep 11 2021
%F A047407 Sum_{n>=2} (-1)^n/a(n) = (2-sqrt(2))*log(2)/16 + sqrt(2)*log(sqrt(2)+2)/8 - (sqrt(2)-1)*Pi/16. - _Amiram Eldar_, Dec 19 2021
%p A047407 A047407:=n->2*(12*n-9-2*sqrt(3)*sin(2*n*Pi/3))/9: seq(A047407(n), n=1..100); # _Wesley Ivan Hurt_, Jun 10 2016
%t A047407 Select[Range[0,200], MemberQ[{0,4,6}, Mod[#,8]]&] (* or *) LinearRecurrence[{1,0,1,-1}, {0,4,6,8}, 70] (* _Harvey P. Dale_, Apr 20 2016 *)
%o A047407 (Magma) [n : n in [0..160] | n mod 8 in [0, 4, 6]]; // _Vincenzo Librandi_, May 02 2016
%o A047407 (PARI) a(n)=n\3*8+[-2,0,4][n%3+1] \\ _Charles R Greathouse IV_, May 02 2016
%Y A047407 Cf. A004772, A047395, A047410, A047464.
%K A047407 nonn,easy
%O A047407 1,2
%A A047407 _N. J. A. Sloane_