|
|
A247904
|
|
Start with a single pentagon; at n-th generation add a pentagon at each expandable vertex (this is the "vertex to side" version); a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)
|
|
7
|
|
|
1, 6, 21, 56, 131, 286, 601, 1236, 2511, 5066, 10181, 20416, 40891, 81846, 163761, 327596, 655271, 1310626, 2621341, 5242776, 10485651, 20971406, 41942921, 83885956, 167772031, 335544186, 671088501, 1342177136, 2684354411, 5368708966, 10737418081
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Refer to A247619, which is the "vertex to vertex" expansion version. For this case, the expandable vertices of the existing generation will contact the sides of the new ones i.e."vertex to side" expansion version. Let us assign the label "1" to the pentagon at the origin; at n-th generation add a pentagon at each expandable vertex, i.e. each vertex where the added generations will not overlap the existing ones, although overlaps among new generations are allowed. The non-overlapping pentagons will have the same label value as a predecessor; for the overlapping ones, the label value will be sum of label values of predecessors. a(n) is the sum of all label values at n-th generation. The pentagons count is A005891. See illustration. For n >= 1, (a(n) - a(n-1))/5 is A000225.
|
|
LINKS
|
|
|
FORMULA
|
a(0) = 1, for n >= 1, a(n) = 5*A000225(n) + a(n-1).
a(n) = 4*a(n-1)-5*a(n-2)+2*a(n-3). - Colin Barker, Sep 26 2014
G.f.: (1+2*x+2*x^2)/((1-x)^2*(1-2*x)). - Colin Barker, Sep 26 2014
a(n) = 10*2^n - (5*n + 9).
E.g.f.: 10*exp(2*x) - (9 + 5*x)*exp(x). (End)
|
|
MATHEMATICA
|
LinearRecurrence[{4, -5, 2}, {1, 6, 21}, 51] (* G. C. Greubel, Feb 18 2022 *)
|
|
PROG
|
(PARI)
a(n) = if (n<1, 1, 5*(2^n-1)+a(n-1))
for (n=0, 50, print1(a(n), ", "))
(PARI)
Vec(-(2*x^2+2*x+1)/((x-1)^2*(2*x-1)) + O(x^100)) \\ Colin Barker, Sep 26 2014
(Magma) [10*2^n -(5*n+9): n in [0..50]]; // G. C. Greubel, Feb 18 2022
(Sage) [5*2^(n+1) -(5*n+9) for n in (0..50)] # G. C. Greubel, Feb 18 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|