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 A116362 #14 May 24 2021 15:16:25 %S A116362 0,1,3,7,11,23,39,79,143,287,543,1087,2111,4223,8319,16639,33023, %T A116362 66047,131583,263167,525311,1050623,2099199,4198399,8392703,16785407, %U A116362 33562623,67125247,134234111,268468223,536903679,1073807359,2147549183,4295098367 %N A116362 Smallest m such that A116361(m) = n. %C A116362 a(n) = 2*a(n-1) + 1 - 0^(n mod 2) * 2^floor(n/2) for n>2. %H A116362 Colin Barker, <a href="/A116362/b116362.txt">Table of n, a(n) for n = 0..1000</a> %H A116362 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,0,-6,4). %F A116362 a(n) = 2^(n-1) + 2^floor((n+1)/2) - 1 for n > 1. %F A116362 a(n) = 3*a(n-1)-6*a(n-3)+4*a(n-4) for n>5. G.f.: -x*(4*x^4-4*x^3-2*x^2+1) / ((x-1)*(2*x-1)*(2*x^2-1)). - _Colin Barker_, Mar 29 2013 and Feb 09 2015 %o A116362 (PARI) concat(0, Vec(-x*(4*x^4-4*x^3-2*x^2+1)/((x-1)*(2*x-1)*(2*x^2-1)) + O(x^100))) \\ _Colin Barker_, Feb 09 2015 %Y A116362 Cf. A116361. %K A116362 nonn,easy %O A116362 0,3 %A A116362 _Reinhard Zumkeller_, Feb 04 2006