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.

A166774 Number of n X 8 1..2 arrays containing at least one of each value, and all equal values connected.

Original entry on oeis.org

14, 240, 7432, 241542, 7855758, 253872596, 8093169792, 255122769986, 7970906327712, 247157616043778, 7612389643759656, 233047562889531042, 7095832481400967212, 214993871402051336458, 6485057217704886418618, 194824321266936718091888, 5831359188043905108147376, 173952785425039482256265510
Offset: 1

Views

Author

R. H. Hardin, Oct 21 2009

Keywords

Examples

			Some solutions for n=3
...2.2.2.2.2.2.2.2...2.1.1.1.1.1.1.1...2.1.1.1.1.1.1.2...2.2.2.2.2.2.2.1
...1.1.1.2.2.2.2.1...2.1.2.1.1.1.1.1...2.2.1.1.1.1.1.2...2.1.1.1.1.1.1.1
...1.1.1.1.1.1.1.1...2.2.2.2.2.2.2.2...2.2.2.2.2.2.2.2...2.2.2.2.1.1.1.1
------
...1.1.1.1.1.1.1.1...2.2.2.2.1.1.1.1...1.1.1.2.2.2.2.2...2.2.1.1.1.1.1.1
...1.1.1.1.2.1.1.1...2.2.1.1.1.1.1.1...1.2.2.2.2.2.2.2...2.2.2.2.2.2.1.1
...1.1.1.1.2.2.2.1...1.1.1.1.1.1.1.1...1.1.1.1.1.1.2.2...2.2.1.1.1.1.1.1
		

Crossrefs

Twice row 8 of A378932.

Extensions

a(6) onwards from Andrew Howroyd, Dec 12 2024