Pascal’s Triangle: Cellular Automata and Attractors

1992 ◽  
pp. 67-115
Author(s):  
Heinz-Otto Peitgen ◽  
Hartmut Jürgens ◽  
Dietmar Saupe
1996 ◽  
Vol 66 (1) ◽  
pp. 1-22 ◽  
Author(s):  
J.-P Allouche ◽  
F von Haeseler ◽  
H.-O Peitgen ◽  
G Skordev

2004 ◽  
pp. 377-422
Author(s):  
Heinz-Otto Peitgen ◽  
Hartmut Jürgens ◽  
Dietmar Saupe

1992 ◽  
pp. 407-456
Author(s):  
Heinz-Otto Peitgen ◽  
Hartmut Jürgens ◽  
Dietmar Saupe

1941 ◽  
Vol 25 (264) ◽  
pp. 118
Author(s):  
G. A. Garreau

1992 ◽  
Vol 99 (6) ◽  
pp. 538-544 ◽  
Author(s):  
Andreas M. Hinz

2012 ◽  
Vol 96 (536) ◽  
pp. 213-220
Author(s):  
Harlan J. Brothers

Pascal's triangle is well known for its numerous connections to probability theory [1], combinatorics, Euclidean geometry, fractal geometry, and many number sequences including the Fibonacci series [2,3,4]. It also has a deep connection to the base of natural logarithms, e [5]. This link to e can be used as a springboard for generating a family of related triangles that together create a rich combinatoric object.2. From Pascal to LeibnizIn Brothers [5], the author shows that the growth of Pascal's triangle is related to the limit definition of e.Specifically, we define the sequence sn; as follows [6]:


1963 ◽  
Vol 47 (359) ◽  
pp. 57
Author(s):  
Robert Croasdale

2016 ◽  
Vol 3 (1) ◽  
pp. 1264176 ◽  
Author(s):  
Kantaphon Kuhapatanakul ◽  
Lishan Liu

Sign in / Sign up

Export Citation Format

Share Document