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 A047371 #20 Sep 08 2022 08:44:57 %S A047371 0,2,3,5,7,9,10,12,14,16,17,19,21,23,24,26,28,30,31,33,35,37,38,40,42, %T A047371 44,45,47,49,51,52,54,56,58,59,61,63,65,66,68,70,72,73,75,77,79,80,82, %U A047371 84,86,87,89,91,93,94,96,98,100,101,103,105,107,108,110 %N A047371 Numbers that are congruent to {0, 2, 3, 5} mod 7. %H A047371 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1). %F A047371 a(n) = floor((7n-6)/4). [_Gary Detlefs_, Mar 06 2010] %F A047371 G.f.: x^2*(2+x+2*x^2+2*x^3) / ( (1+x)*(x^2+1)*(x-1)^2 ). - _R. J. Mathar_, Dec 04 2011 %F A047371 From _Wesley Ivan Hurt_, Jun 04 2016: (Start) %F A047371 a(n) = a(n-1) + a(n-4) - a(n-5) for n>5. %F A047371 a(n) = i^(-n)*((14*n-15)*i^n+i-1-(1+i)*i^(2*n)+i^(-n))/8 where i=sqrt(-1). %F A047371 a(2k) = A047385(k), a(2k-1) = A047355(k). (End) %F A047371 E.g.f.: (8 + sin(x) - cos(x) + (7*x - 8)*sinh(x) + 7*(x - 1)*cosh(x))/4. - _Ilya Gutkovskiy_, Jun 04 2016 %p A047371 seq(floor((7*n-6)/4), n=1..56); # [_Gary Detlefs_, Mar 06 2010] %t A047371 Table[I^(-n)*((14n-15)*I^n+I-1-(1+I)*I^(2n)+I^(-n))/8, {n, 80}] (* _Wesley Ivan Hurt_, Jun 04 2016 *) %t A047371 LinearRecurrence[{1,0,0,1,-1},{0,2,3,5,7},70] (* _Harvey P. Dale_, Oct 24 2018 *) %o A047371 (Magma) [n : n in [0..150] | n mod 7 in [0, 2, 3, 5]]; // _Wesley Ivan Hurt_, Jun 04 2016 %Y A047371 Cf. A047355, A047385. %K A047371 nonn,easy %O A047371 1,2 %A A047371 _N. J. A. Sloane_