|
| |
|
|
A137299
|
|
Square matrix read by anti-diagonals: T(m,n) = m-th term in the continued fraction expansion of pi^n.
|
|
1
| |
|
|
3, 9, 7, 31, 1, 15, 97, 159, 6, 1, 306, 2, 3, 1, 292, 961, 50, 2, 7, 2, 1, 3020, 2, 1, 3, 1, 47, 1, 9488, 3, 1, 4, 1, 13, 1, 1, 29809, 1, 2, 1, 60, 16539, 2, 8, 2, 93648, 10, 1, 2, 3, 1, 1, 1, 1, 1, 294204, 21, 14, 7, 3, 9, 4, 6, 3, 1, 3, 924269, 55, 15, 1, 1, 2, 1, 23, 7, 1, 2, 1
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The sequence was suggested by Leroy Quet.
|
|
|
LINKS
| J. S. Markovitch, Coincidence, data compression and Mach's concept of "economy of thought"
|
|
|
EXAMPLE
| The matrix limited to order 10 is given by matrix(10,10,m,n,contfrac(Pi^n)[m]) :
[ 3 9 31 97 306 961 3020 9488 29809 93648]
[ 7 1 159 2 50 2 3 1 10 21]
[15 6 3 2 1 1 2 1 14 15]
[ 1 1 7 3 4 1 2 7 1 1]
[292 2 1 1 60 3 3 1 9 4]
[ 1 47 13 16539 1 9 2 1 3 2]
[ 1 1 2 1 4 1 10 3 1 1]
[ 1 8 1 6 23 5 4 1 5 3]
[ 2 1 3 7 1 1 1 1 8 2]
[ 1 1 1 6 2 3 1 1 16 1]
|
|
|
PROG
| (PARI) concat(vector(20, i, vector(i, j, contfrac(Pi^(i-j+1))[j])))
(PARI) T(m, n)=contfrac(Pi^n)[m]
|
|
|
CROSSREFS
| Cf. A001203, A138324, A001672.
Sequence in context: A010634 A146179 A178414 * A001226 A093498 A200240
Adjacent sequences: A137296 A137297 A137298 * A137300 A137301 A137302
|
|
|
KEYWORD
| nonn,easy,tabl
|
|
|
AUTHOR
| M. F. Hasler (www.univ-ag.fr/~mhasler), Mar 14 2008
|
| |
|
|
