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 A047404 #30 Sep 15 2024 17:34:17
%S A047404 1,2,3,6,9,10,11,14,17,18,19,22,25,26,27,30,33,34,35,38,41,42,43,46,
%T A047404 49,50,51,54,57,58,59,62,65,66,67,70,73,74,75,78,81,82,83,86,89,90,91,
%U A047404 94,97,98,99,102,105,106,107,110,113,114,115,118,121,122,123
%N A047404 Numbers that are congruent to {1, 2, 3, 6} mod 8.
%H A047404 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,-2,2,-1).
%F A047404 a(n) = A056594(n) + 2*n-2. - _Zerinvary Lajos_, Jul 06 2008
%F A047404 G.f.: x*(1+x)*(2*x^2-x+1)/((x^2+1)*(x-1)^2). - _R. J. Mathar_, Oct 08 2011
%F A047404 From _Wesley Ivan Hurt_, May 30 2016: (Start)
%F A047404 a(n) = 2*a(n-1) - 2*a(n-2) + 2*a(n-3) - a(n-4) for n>4.
%F A047404 a(n) = (4*n-4+i^(1-n)-i^(1+n))/2 where i = sqrt(-1).
%F A047404 a(2k) = A016825(k-1) k>0, a(2k-1) = A047471(k). (End)
%F A047404 E.g.f.: 2 + sin(x) + 2*(x - 1)*exp(x). - _Ilya Gutkovskiy_, May 30 2016
%F A047404 Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt(2)*Pi/8 + log(2)/4. - _Amiram Eldar_, Dec 23 2021
%p A047404 A047404:=n->(4*n-4+I^(1-n)-I^(1+n))/2: seq(A047404(n), n=1..100); # _Wesley Ivan Hurt_, May 30 2016
%t A047404 Table[(4n-4+I^(1-n)-I^(1+n))/2, {n, 80}] (* _Wesley Ivan Hurt_, May 30 2016 *)
%t A047404 LinearRecurrence[{2,-2,2,-1},{1,2,3,6},70] (* _Harvey P. Dale_, Sep 15 2024 *)
%o A047404 (Sage) [lucas_number1(n,0,1)+2*n-2 for n in range(1,56)] # _Zerinvary Lajos_, Jul 06 2008
%o A047404 (PARI) a(n)=(n-1)\4*8+[6,1,2,3][n%4+1] \\ _Charles R Greathouse IV_, Jun 11 2015
%o A047404 (Magma) [n : n in [0..150] | n mod 8 in [1, 2, 3, 6]]; // _Wesley Ivan Hurt_, May 30 2016
%Y A047404 Cf. A016825, A047471, A056594.
%K A047404 nonn,easy
%O A047404 1,2
%A A047404 _N. J. A. Sloane_