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 A103214 #39 Apr 04 2024 10:41:57 %S A103214 1,25,49,73,97,121,145,169,193,217,241,265,289,313,337,361,385,409, %T A103214 433,457,481,505,529,553,577,601,625,649,673,697,721,745,769,793,817, %U A103214 841,865,889,913,937,961,985,1009,1033,1057,1081,1105,1129,1153,1177,1201 %N A103214 a(n) = 24*n + 1. %H A103214 Vincenzo Librandi, <a href="/A103214/b103214.txt">Table of n, a(n) for n = 0..3000</a> %H A103214 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A103214 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A103214 From _Elmo R. Oliveira_, Mar 21 2024: (Start) %F A103214 G.f.: (1+23*x)/(1-x)^2. %F A103214 E.g.f.: exp(x)*(1 + 24*x). %F A103214 a(n) = A255185(n+1) - A255185(n). %F A103214 a(n) = 2*a(n-1) - a(n-2) for n >= 2. (End) %t A103214 Range[1, 2000, 24] (* _Vladimir Joseph Stephan Orlovsky_, Jun 14 2011 *) %o A103214 (PARI) a(n)=24*n+1 \\ _Charles R Greathouse IV_, Jun 14 2011 %o A103214 (Magma) [24*n+1: n in [0..60]]; // _Vincenzo Librandi_, Jun 15 2011 %Y A103214 Equals A008606 + 1. Bisection of A017533. %Y A103214 Cf. A255185. %K A103214 nonn,easy %O A103214 0,2 %A A103214 _Ralf Stephan_, Jan 28 2005