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 A206371 #19 Jan 05 2023 03:11:15 %S A206371 32,63,125,249,497,993,1985,3969,7937,15873,31745,63489,126977,253953, %T A206371 507905,1015809,2031617,4063233,8126465,16252929,32505857,65011713, %U A206371 130023425,260046849,520093697,1040187393,2080374785,4160749569,8321499137,16642998273 %N A206371 a(n) = 31*2^n + 1. %H A206371 G. C. Greubel, <a href="/A206371/b206371.txt">Table of n, a(n) for n = 0..1000</a> %H A206371 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2). %F A206371 a(n) = 31*2^n + 1. %F A206371 a(n) = A198275(n) + 2*A083686(n). %F A206371 From _G. C. Greubel_, Jan 05 2023: (Start) %F A206371 a(n) = 31*A000079(n) + 1. %F A206371 a(n) = A257548(n) + 1, for n > 5. %F A206371 G.f.: (32-33*x)/((1-x)*(1-2*x)). %F A206371 E.g.f.: exp(x) + 31*exp(2*x). (End) %t A206371 1+31*2^Range[0,50] (* _G. C. Greubel_, Jan 05 2023 *) %o A206371 (Magma) [31*2^n +1 : n in [0..35]]; %o A206371 (PARI) a(n)=31<<n + 1 \\ _Charles R Greathouse IV_, Jun 01 2015 %o A206371 (SageMath) [1+31*2^n for n in range(51)] # _G. C. Greubel_, Jan 05 2023 %Y A206371 Cf. A000079, A083686, A198275, A257548. %K A206371 nonn,easy %O A206371 0,1 %A A206371 _Brad Clardy_, Feb 07 2012