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-4 of 4 results.

A263420 Number of n X 2 arrays of permutations of 0..n*2-1 with each element moved a city block distance of 0 or 2.

Original entry on oeis.org

1, 4, 36, 196, 961, 5329, 29584, 160000, 868624, 4739329, 25816561, 140517316, 765186244, 4167218916, 22692108321, 123567013441, 672885527616, 3664192267264, 19953231345216, 108654793385121, 591677262389889
Offset: 1

Views

Author

R. H. Hardin, Oct 17 2015

Keywords

Comments

Column 2 of A263424.

Examples

			Some solutions for n=4
..0..5....3..5....0..5....3..1....0..5....3..2....0..1....0..5....4..1....3..2
..1..4....1..7....1..4....6..0....1..3....6..4....2..3....1..3....5..0....5..0
..7..2....0..6....7..6....4..2....7..6....0..1....4..5....4..2....3..6....4..1
..6..3....2..4....2..3....5..7....2..4....5..7....6..7....6..7....2..7....6..7
		

Crossrefs

Cf. A263424.

Formula

Empirical: a(n) = 4*a(n-1) +4*a(n-2) +22*a(n-3) +14*a(n-4) -93*a(n-5) -68*a(n-6) +52*a(n-7) +32*a(n-8) +36*a(n-9) +45*a(n-10) -16*a(n-11) +8*a(n-12) -6*a(n-13) -2*a(n-14) +a(n-15).

A263421 Number of nX3 arrays of permutations of 0..n*3-1 with each element moved a city block distance of 0 or 2.

Original entry on oeis.org

2, 36, 1272, 26244, 532620, 11751184, 256052940, 5521233025, 119493228528, 2588597823744, 56036432705840, 1213019187980625, 26261187063569212, 568530651822400656, 12307989647701123268, 266454168798496644900
Offset: 1

Views

Author

R. H. Hardin, Oct 17 2015

Keywords

Comments

Column 3 of A263424.

Examples

			Some solutions for n=4
..2..7..0....4..1..8....2..1..0....6..3..2....4..3..2....0..5..8....6..3..0
..3.10..1....9..2.11....5..4.11....1..0..7....1..0..5....3..2..1....1..2.11
..4..5..8....0..7..6....6..3..8....8..5.10....8..7.10....4.11.10....8..9.10
..9..6.11....3.10..5....7.10..9...11..4..9....9..6.11....9..6..7....7..4..5
		

Crossrefs

Cf. A263424.

Formula

Empirical recurrence of order 64 (see link above)

A263422 Number of nX4 arrays of permutations of 0..n*4-1 with each element moved a city block distance of 0 or 2.

Original entry on oeis.org

4, 196, 26244, 1993744, 141086884, 10808097444, 831331827076, 63322713408249, 4821670840815504, 367536797553489424, 28019444925515784976, 2135875239154027938961, 162806957002649300388100
Offset: 1

Views

Author

R. H. Hardin, Oct 17 2015

Keywords

Comments

Column 4 of A263424.

Examples

			Some solutions for n=3
..8..9..0..6....0..9.10..1....0..1..7.11....0..3.10.11....8..3..0..6
..1..7..3..2....6..7.11..5....9..5..4..2....4..2..9..7....9..2..1..5
.10..4..5.11....8..4..2..3....8..6.10..3....8..1..5..6...10..4..7.11
		

Crossrefs

Cf. A263424.

A263423 Number of nX5 arrays of permutations of 0..n*5-1 with each element moved a city block distance of 0 or 2.

Original entry on oeis.org

6, 961, 532620, 141086884, 34502512032, 9414955824400, 2581177525941432, 696932281399739401, 188117459428481322624, 50895976667736734492176, 13771969942166582196102000, 3725144577531136163481836521
Offset: 1

Views

Author

R. H. Hardin, Oct 17 2015

Keywords

Comments

Column 5 of A263424.

Examples

			Some solutions for n=2
..6..1..4..3..8....0..7..4..3..2....0..7..6..9..4....0..3..2..1..4
..5..0..9..2..7....1..8..5..6..9....5..2..1..8..3....7..6..5..8..9
		

Crossrefs

Cf. A263424.
Showing 1-4 of 4 results.