Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076765
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076765 Partial sums of Chebyshev sequence S(n,8)=U(n,4)=A001090(n+1). +0
12
1, 9, 72, 568, 4473, 35217, 277264, 2182896, 17185905, 135304345, 1065248856, 8386686504, 66028243177, 519839258913, 4092685828128, 32221647366112, 253680493100769, 1997222297440041, 15724097886419560, 123795560793916440 (list; graph; listen)
OFFSET

0,2

COMMENT

In the tiling {5,3,4} of 3-dimensional hyperbolic space, the number of regular dodecahedra with right angles of the n generation which are contained in an eighth of space (intersection of three pairwise perpendicular hyperplanes which are supported by the faces of a dodecahedron at a vertex).

Let beta be the greatest real root of the polynomial which is defined by the above recurrent equation. Consider the representation of positive numbers in the basis beta. Then the language which consists of the maximal representations of positive numbers is neither regular nor context-free (M. Margenstern's theorem, see second reference, above).

REFERENCES

M. Margenstern and G. Skordev, Tools for devising cellular automata in the 3-dimensional hyperbolic space, I - the geometrical part, proceddings of SCI'2002, Orlando, Florida, Jul 14-18, (2002), vol. XI, 542-547 Vol. 100 (1993), pp. 1-25.

M. Margenstern and G. Skordev, Tools for devising cellular automata in the 3-dimensional hyperbolic space, II - the numeric algorithms, proceddings of SCI'2002, Orlando, Florida, Jul 14-18, (2002), vol. XI, 548-552

LINKS

M. Margenstern, numberof polyhedra at distance n in {5,3,4}

Index entries for sequences relate d to Chebyshev polynomials.

FORMULA

a(n+3) = 9*a(n+2) - 9*a(n+1) + a(n); initial values: a(0) = 1, a(1) = 9, a(2) = 72

a(n)= sum(S(k, 8), k=0..n) with S(k, x)=U(k, x/2) Chebyshev's polynomials of the second kind.

G.f.: 1/((1-x)*(1-8*x+x^2)) = 1/(1-9*x+9*x^2-x^3).

a(n) = 8*a(n-1) - a(n-2) +1; a(-1):=0, a(0)=1.

a(n)= (S(n+1, 8)-S(n, 8) -1)/6, n>=0.

a(n)=-1/6+(7/12)*[4-sqrt(15)]^n-(3/20)*[4-sqrt(15)]^n*sqrt(15)+(7/12)*[4+sqrt(15)]^n+(3/20) *sqrt(15)*[4+sqrt(15)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 25 2008

CROSSREFS

Cf. A092521 (partial sums of S(n, 7)).

Sequence in context: A045993 A084327 A057085 this_sequence A006634 A129328 A003951

Adjacent sequences: A076762 A076763 A076764 this_sequence A076766 A076767 A076768

KEYWORD

nice,easy,nonn

AUTHOR

Maurice MARGENSTERN (margens(AT)lita.univ-metz.fr), Nov 14 2002

EXTENSIONS

Extension and Chebyshev comments from W. Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Aug 31 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research