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 A047286 #18 Sep 08 2022 08:44:56
%S A047286 1,2,3,6,8,9,10,13,15,16,17,20,22,23,24,27,29,30,31,34,36,37,38,41,43,
%T A047286 44,45,48,50,51,52,55,57,58,59,62,64,65,66,69,71,72,73,76,78,79,80,83,
%U A047286 85,86,87,90,92,93,94,97,99,100,101,104,106,107,108,111
%N A047286 Numbers that are congruent to {1, 2, 3, 6} mod 7.
%H A047286 Vincenzo Librandi, <a href="/A047286/b047286.txt">Table of n, a(n) for n = 1..1000</a>
%H A047286 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F A047286 G.f.: x*(1+x+x^2+3*x^3+x^4) / ( (1+x)*(1+x^2)*(x-1)^2 ). - _R. J. Mathar_, Oct 25 2011
%F A047286 From _Wesley Ivan Hurt_, May 22 2016: (Start)
%F A047286 a(n) = a(n-1) + a(n-4) - a(n-5) for n>5.
%F A047286 a(n) = (14n-11+i^(2n)+(1+3i)*i^(-n)+(1-3i)*i^n)/8 where i=sqrt(-1).
%F A047286 a(2n) = A047276(n), a(2n-1) = A047356(n). (End)
%F A047286 E.g.f.: (4 + 3*sin(x) + cos(x) + (7*x - 6)*sinh(x) + (7*x - 5)*cosh(x))/4. - _Ilya Gutkovskiy_, May 23 2016
%p A047286 A047286:=n->(14*n-11+I^(2*n)+(1+3*I)*I^(-n)+(1-3*I)*I^n)/8: seq(A047286(n), n=1..100); # _Wesley Ivan Hurt_, May 22 2016
%t A047286 Table[(14n-11+I^(2n)+(1+3I)*I^(-n)+(1-3I)*I^n)/8, {n, 80}] (* _Wesley Ivan Hurt_, May 22 2016 *)
%t A047286 LinearRecurrence[{1, 0, 0, 1, -1}, {1, 2, 3, 6, 8}, 80] (* _Vincenzo Librandi_, May 24 2016 *)
%o A047286 (Magma) [n : n in [0..150] | n mod 7 in [1, 2, 3, 6]]; // _Wesley Ivan Hurt_, May 22 2016
%Y A047286 Cf. A047276, A047356.
%K A047286 nonn,easy
%O A047286 1,2
%A A047286 _N. J. A. Sloane_
%E A047286 More terms from _Wesley Ivan Hurt_, May 22 2016