Sierpinski Triangle recursion problem

I'm new to scheme and I am looking for a solution (code or pseudocode) to a recursive procedure for Sierpinski's Triangle
VBStudentAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Rok BrnotCommented:
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
computerg33kCommented:
If the numbers in Pascal's triangle divisible by 2 (even numbers) are colored black, and those indivisible by 2 (odd numbers) colored red, the resulting pattern is Sierpinski's Triangle, a recursive fractal. To the right is a picture of this with Pascal's triangle taken out to 128 rows.
http://www.davidscudder.com/pascal/patterns.html

0
VBStudentAuthor Commented:
Thanks to both of you.  That helped me develop an algorithm for scheme
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Programming

From novice to tech pro — start learning today.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.