|
Search: id:A052954
|
|
|
| A052954 |
|
A simple regular expression. |
|
+0
1
|
|
| 2, 1, 2, 2, 2, 3, 3, 4, 5, 6, 8, 10, 13, 17, 22, 29, 38, 50, 66, 87, 115, 152, 201, 266, 352, 466, 617, 817, 1082, 1433, 1898, 2514, 3330, 4411, 5843, 7740, 10253, 13582, 17992, 23834, 31573, 41825, 55406, 73397, 97230, 128802, 170626, 226031, 299427
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
For n>2 a(n) = floor{sqrt(a(n-3)*a(n-2) + a(n-2)*a(n-1) + a(n-1)*a(n-3))} - Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Sep 19 2004
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1025
|
|
FORMULA
|
G.f.: -(-2+x+x^2+x^3)/(-1+x^2+x^3)/(-1+x)
Recurrence: {a(1)=1, a(2)=2, a(3)=2, a(0)=2, -a(n)-a(n+1)+1+a(n+3)}
1+Sum(-1/23*(-3-7*_alpha+2*_alpha^2)*_alpha^(-1-n), _alpha=RootOf(_Z^3+_Z^2-1))
lim n->inf a(n)/a(n-1) = positive root of 1+x-x^3 (smallest Pisot-Vijayaraghavan number, A060006) - Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Sep 19 2004
|
|
MAPLE
|
spec := [S, {S=Union(Sequence(Prod(Union(Prod(Z, Z), Z), Z)), Sequence(Z))}, unlabeled ]: seq(combstruct[count ](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Cf. A060006 A023434.
Sequence in context: A084840 A029278 A125950 this_sequence A123505 A114920 A030361
Adjacent sequences: A052951 A052952 A052953 this_sequence A052955 A052956 A052957
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 05 2000
|
|
|
Search completed in 0.002 seconds
|
