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 A017185 #39 Apr 12 2025 10:19:00
%S A017185 2,11,20,29,38,47,56,65,74,83,92,101,110,119,128,137,146,155,164,173,
%T A017185 182,191,200,209,218,227,236,245,254,263,272,281,290,299,308,317,326,
%U A017185 335,344,353,362,371,380,389,398,407,416,425,434,443,452,461,470,479
%N A017185 a(n) = 9*n + 2.
%C A017185 Numbers whose digital root is 2. - _Cino Hilliard_, Dec 26 2006
%H A017185 Vincenzo Librandi, <a href="/A017185/b017185.txt">Table of n, a(n) for n = 0..5000</a>
%H A017185 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A017185 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017185 G.f.: (2 + 7*x)/(x - 1)^2. - _R. J. Mathar_, Jul 14 2016
%F A017185 E.g.f.: exp(x)*(2 + 9*x). - _Stefano Spezia_, Dec 07 2024
%F A017185 From _Elmo R. Oliveira_, Apr 12 2025: (Start)
%F A017185 a(n) = 2*a(n-1) - a(n-2).
%F A017185 a(n) = A016789(3*n). (End)
%t A017185 Range[2, 1000, 9] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *)
%t A017185 LinearRecurrence[{2,-1},{2,11},60] (* _Harvey P. Dale_, Jun 09 2023 *)
%o A017185 (Magma) [9*n+2: n in [0..60]]; // _Vincenzo Librandi_, Jul 23 2011
%o A017185 (PARI) a(n)=9*n+2 \\ _Charles R Greathouse IV_, Oct 07 2015
%Y A017185 Cf. A008591, A016789, A017173.
%K A017185 nonn,easy
%O A017185 0,1
%A A017185 _N. J. A. Sloane_
%E A017185 More terms from _Cino Hilliard_, Dec 26 2006