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 A047276 #37 Sep 02 2024 10:41:53
%S A047276 2,6,9,13,16,20,23,27,30,34,37,41,44,48,51,55,58,62,65,69,72,76,79,83,
%T A047276 86,90,93,97,100,104,107,111,114,118,121,125,128,132,135,139,142,146,
%U A047276 149,153,156,160,163,167,170,174,177,181,184,188,191,195,198,202,205
%N A047276 Numbers that are congruent to {2, 6} mod 7.
%H A047276 Daniel Starodubtsev, <a href="/A047276/b047276.txt">Table of n, a(n) for n = 1..10000</a>
%H A047276 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F A047276 a(n) = 7*n - a(n-1) - 6 (with a(1)=2). - _Vincenzo Librandi_, Aug 05 2010
%F A047276 G.f.: x*(2 + 4*x + x^2) / ( (1+x)*(x-1)^2 ). - _R. J. Mathar_, Oct 25 2011
%F A047276 a(n) = 3*n + floor(n/2) - 1. - _Arkadiusz Wesolowski_, Sep 19 2012
%F A047276 E.g.f.: 1 + ((14*x - 5)*exp(x) + exp(-x))/4. - _David Lovler_, Sep 12 2022
%t A047276 Table[3*n + Floor[n/2] - 1, {n, 100}] (* _Paolo Xausa_, Sep 02 2024 *)
%o A047276 (PARI) a(n) = 3*n + floor(n/2) - 1 \\ _David Lovler_, Sep 12 2022
%K A047276 nonn,easy
%O A047276 1,1
%A A047276 _N. J. A. Sloane_