|
|
A099393
|
|
a(n) = 4^n + 2^n - 1.
|
|
15
|
|
|
1, 5, 19, 71, 271, 1055, 4159, 16511, 65791, 262655, 1049599, 4196351, 16781311, 67117055, 268451839, 1073774591, 4295032831, 17180000255, 68719738879, 274878431231, 1099512676351, 4398048608255, 17592190238719
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Number of occurrences of letter 2 in the (n+1)-st Peano word.
In binary representation, a leading one followed by n zeros then by n ones. - Reinhard Zumkeller, Feb 07 2006
The number of involutions in group G_n G_{n+1} = G_n(operation) D_8. For example, Q_8->1 involution; D_8->5 involutions - Roger L. Bagula, Aug 08 2007
|
|
LINKS
|
Sergey Kitaev, Toufik Mansour, and Patrice Séébold, Generating the Peano curve and counting occurrences of some patterns, Journal of Automata, Languages and Combinatorics, volume 9, number 4, 2004, pages 439-455. Also at ResearchGate. Section 4, |P_n|_r = a(n-1).
|
|
FORMULA
|
G.f.: 1/(1-4*x) + 1/(1-2*x) - 1/(1-x).
E.g.f.: e^(4*x) + e^(2*x) - e^x. (End)
|
|
EXAMPLE
|
n=5: a(5)=4^5+2^5-1=1024+32-1=1055 -> '10000011111'.
|
|
MATHEMATICA
|
LinearRecurrence[{7, -14, 8}, {1, 5, 19}, 30] (* Harvey P. Dale, Sep 06 2015 *)
|
|
PROG
|
|
|
CROSSREFS
|
See the formula section for the relationships with A000120, A000217, A000225, A002378, A007582, A020522, A023416, A030101, A063376, A070939, A083420, A279396.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|