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 A017257 #48 Dec 08 2024 10:20:42 %S A017257 8,17,26,35,44,53,62,71,80,89,98,107,116,125,134,143,152,161,170,179, %T A017257 188,197,206,215,224,233,242,251,260,269,278,287,296,305,314,323,332, %U A017257 341,350,359,368,377,386,395,404,413,422,431,440,449,458,467,476,485 %N A017257 a(n) = 9*n + 8. %C A017257 Digital root of any number in this sequence = 8. Any partial sum of digits of any number in this sequence also belongs to this sequence. - _Artur Jasinski_, Dec 16 2007 %C A017257 Subsequence of A224829: A224823(a(n)) = 0. - _Reinhard Zumkeller_, Jul 21 2013 %H A017257 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A017257 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=970">Encyclopedia of Combinatorial Structures 970</a>. %H A017257 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A017257 a(n-1)^2 - A013656(n) * A010701(n)^2 = 1. - _Vincenzo Librandi_, Nov 19 2010 %F A017257 From _Colin Barker_, Jan 24 2012: (Start) %F A017257 a(0)=8, a(1)=17, a(n) = 2*a(n-1)-a(n-2). %F A017257 G.f.: (8+x)/(1-x)^2. (End) %F A017257 E.g.f.: exp(x)*(8 + 9*x). - _Stefano Spezia_, Dec 08 2024 %p A017257 A017257:=n->9*n+8; seq(A017257(n), n=0..100); # _Wesley Ivan Hurt_, Nov 30 2013 %t A017257 Array[9*#+8&,100,0] (* _Vladimir Joseph Stephan Orlovsky_, Dec 14 2009 *) %o A017257 (Haskell) %o A017257 a017257 = (+ 8) . (* 9) %o A017257 a017257_list = 8 : map (+ 9) a017257_list -- _Reinhard Zumkeller_, Jul 21 2013 %o A017257 (PARI) a(n)=9*n+8 \\ _Charles R Greathouse IV_, Sep 28 2015 %Y A017257 Cf. A013656, A010701, A008591. %K A017257 nonn,easy %O A017257 0,1 %A A017257 _N. J. A. Sloane_