cp's OEIS Frontend

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.

A227712 a(n) = 9*2^n - 3*n - 5.

Original entry on oeis.org

4, 10, 25, 58, 127, 268, 553, 1126, 2275, 4576, 9181, 18394, 36823, 73684, 147409, 294862, 589771, 1179592, 2359237, 4718530, 9437119, 18874300, 37748665, 75497398, 150994867, 301989808, 603979693, 1207959466, 2415919015, 4831838116, 9663676321, 19327352734
Offset: 0

Views

Author

Emeric Deutsch, Aug 06 2013

Keywords

Comments

Denoting by P[n] the path on n vertices, a(n) is the number of vertices of the tree obtained by identifying the roots of 3 identical rooted trees g[n], where g[n] is obtained recursively in the following manner: g[0]=P[2] and g[n] (n>=1) is obtained by identifying the roots of 2 copies of g[n-1] and one of the extremities of P[n+1]; the root of g[n] is defined to be the other extremity of P[n+1]. Most references contain pictures of these trees; however, the small circles have to be viewed as vertices rather than hexagons.

Examples

			a(1) = 10 because g[1] is the rooted tree in the shape of Y (4 vertices) and a "bouquet" of three Y's has 3*4 - 2 = 10 vertices.
		

Crossrefs

Cf. A079583.

Programs

  • Magma
    [9*2^n-3*n-5: n in [0..40]]; // Vincenzo Librandi, Feb 19 2016
  • Maple
    a := proc (n) options operator, arrow: 9*2^n-3*n-5 end proc: seq(a(n), n = 0 .. 35);
  • Mathematica
    Table[9*2^n-3n-5,{n,0,40}] (* or *) LinearRecurrence[{4,-5,2},{4,10,25},40] (* Harvey P. Dale, Apr 15 2015 *)
  • PARI
    Vec((4-6*x+5*x^2)/((1-2*x)*(1-x)^2) + O(x^100)) \\ Altug Alkan, Oct 17 2015
    

Formula

G.f.: (4-6*x+5*x^2)/((1-2*x)*(1-x)^2).
a(0)=4, a(1)=10, a(2)=25, a(n) = 4*a(n-1)-5*a(n-2)+2*a(n-3). - Harvey P. Dale, Apr 15 2015
a(n)= 3*A079583(n) + 1. - Emeric Deutsch, Feb 18 2016