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 A132689 #15 Sep 08 2022 08:45:31
%S A132689 1,6,55,816,23751,1712304,377447148,294109729200,871896500955975,
%T A132689 10061777828754031380,451004941990890693018405,
%U A132689 77739225019650285306412710240,51039474754930845750609669420261300
%N A132689 a(n) = binomial(2^n + 3*n + 1, n).
%H A132689 G. C. Greubel, <a href="/A132689/b132689.txt">Table of n, a(n) for n = 0..50</a>
%F A132689 a(n) = [x^n] 1/(1-x)^(2^n + 2*n + 2).
%p A132689 A132689:=n->binomial(2^n+3*n+1, n): seq(A132689(n), n=0..15); # _Wesley Ivan Hurt_, Nov 20 2014
%t A132689 Table[Binomial[2^n +3n +1, n], {n, 0, 15}] (* _Wesley Ivan Hurt_, Nov 20 2014 *)
%o A132689 (PARI) a(n)=binomial(2^n+3*n+1,n)
%o A132689 (Magma) [Binomial(2^n+3*n+1, n) : n in [0..15]]; // _Wesley Ivan Hurt_, Nov 20 2014
%o A132689 (Sage) [binomial(2^n +3*n+1, n) for n in (0..15)] # _G. C. Greubel_, Feb 15 2021
%Y A132689 Sequences of the form binomial(2^n +p*n +q, n): A136556 (0,-1), A014070 (0,0), A136505 (0,1), A136506 (0,2), A060690 (1,-1), A132683 (1,0), A132684 (1,1), A132685 (2,0), A132686 (2,1), A132687 (3,-1), A132688 (3,0), this sequence (3,1).
%Y A132689 Cf. A136555.
%K A132689 nonn,easy
%O A132689 0,2
%A A132689 _Paul D. Hanna_, Aug 26 2007