login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A223345 3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of n X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph 1
6, 52, 2280, 405988, 329268616, 1079538816324, 16086247351158920, 968803030037550870052, 265167552942550197086665096, 293336730456466043837816011720516 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Diagonal of A223352

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..15

EXAMPLE

Some solutions for n=3

..4..1..3....1..4..2....4..1..3....1..0..2....0..2..0....1..4..1....5..2..5

..1..3..1....0..2..5....2..4..1....0..2..5....2..5..2....0..1..4....2..5..2

..3..1..4....1..0..2....5..2..0....1..0..2....0..2..5....2..0..1....4..2..4

CROSSREFS

Sequence in context: A164894 A027835 A055973 * A066357 A276365 A185148

Adjacent sequences:  A223342 A223343 A223344 * A223346 A223347 A223348

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 19 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 05:14 EST 2019. Contains 329839 sequences. (Running on oeis4.)