|
Search: id:A099393
|
|
| |
|
| 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; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Number of occurrences of letter 2 in (n+1)-st Peano word.
a(n) = A020522(n)+A000225(n+1) = A083420(n)-A020522(n); in binary representation: a leading one followed by n zeros then by n ones; A000120(a(n))=n+1; A023416(a(n))=n; A070939(a(n))=2*n+1; 2*A020522(n)+1=A030101(a(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), 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 (rlbagulatftn(AT)yahoo.com), Aug 08 2007
|
|
REFERENCES
|
A.M.Cohen,D.E. Taylor, American Math Monthly, volume 114,Number 7, Aug-Sept 2007, pages 633-638
|
|
LINKS
|
S. Kitaev and T. Mansour, The Peano curve and counting occurrences of some pattern
|
|
FORMULA
|
a(n) = 2^(2*n-1)+2*a(n-1)+1 - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Aug 08 2007
|
|
EXAMPLE
|
n=5: a(5)=4^5+2^5-1=1024+32-1=1055 -> '10000011111'.
|
|
MATHEMATICA
|
f[n_Integer?Positive] := f[n] = 2^(2*(n - 1) + 1)+2*f[n - 1] + 1 f[0] = 1; Table[f[n], {n, 0, 30}] - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Aug 08 2007
|
|
CROSSREFS
|
Equals A063376(n) - 1.
Sequence in context: A095073 A128349 A001834 this_sequence A083588 A086386 A047155
Adjacent sequences: A099390 A099391 A099392 this_sequence A099394 A099395 A099396
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ralf Stephan, Oct 20 2004
|
|
|
Search completed in 0.002 seconds
|
