login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227298 The number of squares added in the n-th step of a Pythagoras tree of the 30-60-90 triangle, using the rule larger squares come first. 2
1, 2, 4, 8, 16, 30, 56, 102, 186, 340, 624, 1148 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Growth of the Pythagoras tree based on the triangle with internal angles of 30, 60 and 90 degrees.
The generating rule is expansion in sequential order on each stage; the larger squares (opposite to the 60 deg angle) come first. The generating order labeled by "stage-number" starts as 1-1; 2-1, 2-2; 3-1, 3-2, 3-3, 3-4;...and so on. Overlap is prohibited, i.e., if any part of a new element in the next generating order cuts into any previous (existing, lower order) one, that new elements will be not be inserted/added: lower generating orders have precedence over higher generating orders.
The non-overlap rule limits the growth of the sequence to a(n+1) <= 2*a(n).
For Pythagoras tree based on isosceles right triangle with the same rule, the sequence will be A053599(n-1) + 1.
LINKS
Kival Ngaokrajang, Illustration for n = 1..11
CROSSREFS
Sequence in context: A005305 A298402 A125548 * A164229 A054668 A164225
KEYWORD
nonn,more
AUTHOR
Kival Ngaokrajang, Jul 05 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)