|
Search: id:A069403
|
|
|
| A069403 |
|
a(n) = 2*Fibonacci(2n+1)-1. |
|
+0
5
|
|
| 1, 3, 9, 25, 67, 177, 465, 1219, 3193, 8361, 21891, 57313, 150049, 392835, 1028457, 2692537, 7049155, 18454929, 48315633, 126491971, 331160281, 866988873, 2269806339, 5942430145, 15557484097, 40730022147, 106632582345
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Half the number of n X 3 binary arrays with a path of adjacent 1's and a path of adjacent 0's from top row to bottom row.
|
|
LINKS
|
J. Hietarinta and C.-M. Viallet, Singularity confinement and chaos in discrete systems, Physical Review Letters 81 (1998), pp. 326-328.
|
|
FORMULA
|
a(0) = 1, a(1) = 3, a(2) = 9, a(3) = 25; a(n) = 3 a(n-1) - 3 a(n-3) + a(n-4).
a(n) = 3*a(n-1) - a(n-2) + 1 for n>1, a(1) = 3, a(0) = 0. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 02 2006
|
|
MATHEMATICA
|
a[n_] := a[n] = 3 a[n - 1] - 3 a[n - 3] + a[n - 4]; a[0] = 1; a[1] = 3; a[2] = 9; a[3] = 25; Table[ a[n], {n, 0, 27}]
|
|
CROSSREFS
|
Cf. A084707.
Cf. 1 X n A000225, 2 X n A016269, vertical path of 1 A069361-A069395, vertical paths of 0+1 A069396-A069416, vertical path of 1 not 0 A069417-A069428, no vertical paths A069429-A069447, no horizontal or vertical paths A069448-A069452.
Equals A052995 - 1. Bisection of A001595, A062114, A066983.
Sequence in context: A081663 A106514 A085327 this_sequence A094292 A000242 A077846
Adjacent sequences: A069400 A069401 A069402 this_sequence A069404 A069405 A069406
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhh(AT)cadence.com), Mar 22 2002.
|
|
EXTENSIONS
|
Simpler definition from Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 19 2003
|
|
|
Search completed in 0.003 seconds
|
