|
Search: id:A052995
|
|
|
| A052995 |
|
A simple regular expression. |
|
+0
4
|
|
| 0, 2, 4, 10, 26, 68, 178, 466, 1220, 3194, 8362, 21892, 57314, 150050, 392836, 1028458, 2692538, 7049156, 18454930, 48315634, 126491972, 331160282, 866988874, 2269806340, 5942430146, 15557484098, 40730022148, 106632582346
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Terms >=4 give solutions x to floor(phi^2*x^2)-floor(phi*x)^2 = 5, where phi=(1+sqrt(5))/2 - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 16 2003
|
|
REFERENCES
|
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 30.
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1072
|
|
FORMULA
|
G.f.: -2*x*(-1+x)/(1-3*x+x^2)
Recurrence: {a(0)=0, a(2)=4, a(1)=2, a(n)-3*a(n+1)+a(n+2)}
Sum(2/5*(-1+4*_alpha)*_alpha^(-1-n), _alpha=RootOf(_Z^2-3*_Z+1))
a(n) = 2*Fibonacci(2*n-1), n>0. - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 19 2003
a(n+2) = F(n)^2 + F(n+3)^2 = 2F(n+1)^2 + 2F(n+2)^2.
|
|
MAPLE
|
spec := [S, {S=Prod(Sequence(Union(Prod(Sequence(Z), Z), Z)), Union(Z, Z))}, unlabeled ]: seq(combstruct[count ](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Equals A069403(n-1)+1. Bisection of A006355. First differences of A025169. Cf. A055819.
Sequence in context: A149810 A095337 A162533 this_sequence A055819 A113337 A084575
Adjacent sequences: A052992 A052993 A052994 this_sequence A052996 A052997 A052998
|
|
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
|
