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 A047346 #41 Sep 02 2022 01:55:40
%S A047346 1,4,8,11,15,18,22,25,29,32,36,39,43,46,50,53,57,60,64,67,71,74,78,81,
%T A047346 85,88,92,95,99,102,106,109,113,116,120,123,127,130,134,137,141,144,
%U A047346 148,151,155,158,162,165,169,172,176,179,183,186,190,193,197,200,204,207,211,214
%N A047346 Numbers that are congruent to {1, 4} mod 7.
%H A047346 Daniel Starodubtsev, <a href="/A047346/b047346.txt">Table of n, a(n) for n = 1..10000</a>
%H A047346 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F A047346 a(n) = floor( (7n-5)/2 ). - _Santi Spadaro_, Jul 24 2001
%F A047346 G.f.: x*(1 + 3*x + 3*x^2) / ( (1+x)*(x-1)^2 ). - _R. J. Mathar_, Dec 04 2011
%F A047346 a(n) = 4n - 3 - floor(n/2). - _Wesley Ivan Hurt_, Oct 16 2013
%F A047346 E.g.f.: 3 + ((14*x - 11)*exp(x) - exp(-x))/4. - _David Lovler_, Sep 01 2022
%p A047346 A047346:=n->4*n-3-floor(n/2); seq(A047346(k),k=1..100); # _Wesley Ivan Hurt_, Oct 16 2013
%t A047346 Table[4n-3-Floor[n/2],{n,100}] (* _Wesley Ivan Hurt_, Oct 16 2013 *)
%o A047346 (PARI) a(n) = 4*n-n\2-3; \\ _Altug Alkan_, Sep 10 2016
%Y A047346 Cf. A001106.
%K A047346 nonn,easy
%O A047346 1,2
%A A047346 _N. J. A. Sloane_