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 A087289 #96 Feb 22 2025 10:43:17
%S A087289 3,9,33,129,513,2049,8193,32769,131073,524289,2097153,8388609,
%T A087289 33554433,134217729,536870913,2147483649,8589934593,34359738369,
%U A087289 137438953473,549755813889,2199023255553,8796093022209,35184372088833,140737488355329,562949953421313,2251799813685249
%N A087289 a(n) = 2^(2*n+1) + 1.
%C A087289 Number of pairs of polynomials (f,g) in GF(2)[x] satisfying deg(f) <= n, deg(g) <= n and gcd(f,g) = 1.
%C A087289 An unpublished result due to Stephen Suen, _David desJardins_, and _W. Edwin Clark_. This is the case k = 2, q = 2 of their formula q^((n+1)*k) * (1 - 1/q^(k-1) + (q-1)/q^((n+1)*k)) for the number of ordered k-tuples (f_1, ..., f_k) of polynomials in GF(q)[x] such that deg(f_i) <= n for all i and gcd(f_1, ..., f_k) = 1.
%C A087289 Apparently the same as A084508 shifted left.
%C A087289 Terms in binary are palindromes of the form 1x1 where x is a string of 2*n zeros (A152577). - _Brad Clardy_, Sep 01 2011
%C A087289 For n > 0, a(n) is the number k such that the number of iterations of the map k -> (3k +1)/8 == 4 (mod 8) until reaching (3k +1)/8 <> 4 (mod 8) equals n. (see the Collatz problem: the start of the parity trajectory of a(n) is n times {100} = 100100100100...100abcd...). - _Michel Lagneau_, Jan 23 2012
%C A087289 An Engel expansion of 2 to the base 4 as defined in A181565, with the associated series expansion 2 = 4/3 + 4^2/(3*9) + 4^3/(3*9*33) + 4^4/(3*9*33*129) + .... Cf. A199561 and A207262. - _Peter Bala_, Oct 29 2013
%C A087289 For x = A083420(n), y = A000079(n+1), z = a(n) then x^2 + 2*y^2 = z^2. - _Vincenzo Librandi_, Jun 09 2014
%C A087289 A254046(n+1) is the 3-adic valuation of a(n). - _Fred Daniel Kline_, Jan 11 2017
%H A087289 Vincenzo Librandi, <a href="/A087289/b087289.txt">Table of n, a(n) for n = 0..1000</a>
%H A087289 K. Morrison, <a href="https://citeseerx.ist.psu.edu/pdf/d980bc1fc0f75f630be96e7a829478d910109c67">Random polynomials over finite fields</a>.
%H A087289 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (5,-4).
%F A087289 G.f.: (3-6*x)/((1-x)*(1-4*x)).
%F A087289 a(n) = 3*A007583(n).
%F A087289 a(n) = 4*a(n-1) - 3. - _Lekraj Beedassy_, Apr 29 2005
%F A087289 a(n) = A099393(n+1) - 2*A099393(n). - _Brad Clardy_, Sep 01 2011
%F A087289 a(n) = 2^(2*n + 1)*a(-1-n) for all n in Z. - _Michael Somos_, Jan 11 2017
%F A087289 a(n) = A283070(n) - 1. - _Peter M. Chema_, Mar 02 2017
%F A087289 From _Elmo R. Oliveira_, Feb 22 2025: (Start)
%F A087289 E.g.f.: exp(x)*(2*exp(3*x) + 1).
%F A087289 a(n) = 5*a(n-1) - 4*a(n-2). (End)
%e A087289 a(0) = 3 since there are three pairs, (0,1), (1,0) and (1,1) of polynomials (f,g) in GF(2)[x] of degree at most 0 such that gcd(f,g) = 1.
%t A087289 Table[2^(2 n + 1) + 1, {n, 0, 20}] (* or *) 3 NestList[4 # - 1 &, 1, 20]
%t A087289 (* or *) CoefficientList[Series[(3 - 6 x)/((1 - x) (1 - 4 x)), {x, 0, 20}], x] (* _Michael De Vlieger_, Mar 03 2017 *)
%o A087289 (Magma) [2^(2*n+1) + 1: n in [0..30]]; // _Vincenzo Librandi_, May 16 2011
%o A087289 (PARI) a(n)=2^(2*n+1)+1 \\ _Charles R Greathouse IV_, Sep 24 2015
%Y A087289 Cf. A087290, A087291, A087292, A099393.
%Y A087289 Equals A004171 + 1.
%Y A087289 Cf. also A007583, A181565, A199561, A207262, A254046, A283070.
%Y A087289 Cf. A000079, A083420, A084508, A152577.
%K A087289 easy,nonn
%O A087289 0,1
%A A087289 _W. Edwin Clark_, Aug 29 2003