cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A140789 We consider how many ways there are of coloring a square grid, n X n, using just two colors, black & white say. If the resulting grid has TWO lines of symmetry, then the number of different grids is given by this sequence. None of these counted are the images of any of the others under a rotation. If one wishes to count these as different, then each of these numbers can be multiplied by 2.

Original entry on oeis.org

0, 1, 8, 32, 448, 2240, 64512, 556032, 33521664, 553615360, 68717379584, 2233380896768, 562949684985856, 36310271727239168, 18446744004990074880, 2370406613402957905920, 2417851639194073977323520, 620178945462269582252179456, 1267650600228193372699684241408
Offset: 1

Views

Author

Anthony C Robin, Jul 14 2008

Keywords

Crossrefs

Cf. A140650.

Programs

  • PARI
    s=[0]; for(m=1, 15, s=concat(s, [2^(m^2-1)*(2^m+1)-2^(m*(m+1)/2), 2^(m^2+2*m+1)-2^((m^2+3*m+2)/2)])); s \\ Colin Barker, Mar 28 2014

Formula

a(2m) = 2^(m^2 - 1)*(2^m + 1) - 2^(m*(m + 1)/2).
a(2m+1)= 2^(m^2 + 2*m + 1) - 2^((m^2 + 3*m + 2)/2).

Extensions

More terms from Colin Barker, Mar 28 2014
Showing 1-1 of 1 results.