|
|
A305158
|
|
a(n) = 21*2^n - 15.
|
|
3
|
|
|
6, 27, 69, 153, 321, 657, 1329, 2673, 5361, 10737, 21489, 42993, 86001, 172017, 344049, 688113, 1376241, 2752497, 5505009, 11010033, 22020081, 44040177, 88080369, 176160753, 352321521, 704643057, 1409286129, 2818572273, 5637144561, 11274289137, 22548578289, 45097156593, 90194313201, 180388626417
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(n) is the number of edges of the all-aromatic dendrimer G[n], shown pictorially as DNS1[n] in the Shabani et al. reference (Fig. 1).
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 3*(2 + 3*x) / ((1 - x)*(1 - 2*x)).
a(n) = 3*a(n-1) - 2*a(n-2) for n>1.
(End)
|
|
MAPLE
|
seq(21*2^n-15, n = 0..40);
|
|
MATHEMATICA
|
21*2^Range[0, 40]-15 (* or *) LinearRecurrence[{3, -2}, {6, 27}, 40] (* Harvey P. Dale, Apr 15 2019 *)
|
|
PROG
|
(PARI) Vec(3*(2 + 3*x) / ((1 - x)*(1 - 2*x)) + O(x^40)) \\ Colin Barker, May 30 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|