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 A082286 #39 Apr 11 2024 17:22:04 %S A082286 10,28,46,64,82,100,118,136,154,172,190,208,226,244,262,280,298,316, %T A082286 334,352,370,388,406,424,442,460,478,496,514,532,550,568,586,604,622, %U A082286 640,658,676,694,712,730,748,766,784,802,820,838,856,874,892,910,928,946 %N A082286 a(n) = 18*n + 10. %C A082286 Solutions to (11^x + 13^x) mod 19 = 17. %H A082286 Vincenzo Librandi, <a href="/A082286/b082286.txt">Table of n, a(n) for n = 0..2000</a> %H A082286 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A082286 Leo Tavares, <a href="/A082286/a082286.jpg">Illustration: Triangles</a> %H A082286 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A082286 a(n) = A006370(A016945(n)). - _Reinhard Zumkeller_, Apr 17 2008 %F A082286 a(n) = 2*A017221(n). - _Michel Marcus_, Feb 15 2014 %F A082286 a(n) = A060544(n+2) - 9*A000217(n-1). - _Leo Tavares_, Oct 15 2022 %F A082286 From _Elmo R. Oliveira_, Apr 08 2024: (Start) %F A082286 G.f.: 2*(5+4*x)/(1-x)^2. %F A082286 E.g.f.: 2*exp(x)*(5 + 9*x). %F A082286 a(n) = 2*a(n-1) - a(n-2) for n >= 2. %F A082286 a(n) = 2*(A022267(n+1) - A022267(n)). (End) %t A082286 Range[10, 1000, 18] (* _Vladimir Joseph Stephan Orlovsky_, Jun 01 2011 *) %o A082286 (Magma) [18*n + 10: n in [0..60]]; // _Vincenzo Librandi_, May 05 2011 %o A082286 (PARI) a(n)=18*n+10 \\ _Charles R Greathouse IV_, Jul 10 2016 %Y A082286 Cf. A006370, A008600, A016945, A161705. %Y A082286 Cf. A000217, A017221, A022267, A060544. %K A082286 easy,nonn %O A082286 0,1 %A A082286 _Cino Hilliard_, May 10 2003 %E A082286 More terms from _Reinhard Zumkeller_, Apr 17 2008