Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060553 a(n) is the number of distinct (modulo geometric D3-operations) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells. +0
1
2, 2, 4, 6, 10, 16, 32, 52, 104, 192, 376, 720, 1440, 2800, 5600, 11072, 22112, 43968, 87936, 175296, 350592, 700160, 1400192, 2798336, 5596672, 11188992, 22377984, 44747776, 89495040, 178973696, 357947392, 715860992 (list; graph; listen)
page 1

Search completed in 0.001 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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research