The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A264092 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A264092

Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.
(history; published version)

#6 by R. H. Hardin at Tue Nov 10 11:22:50 EST 2015

STATUS

editing

approved

#5 by R. H. Hardin at Tue Nov 10 11:22:47 EST 2015

NAME

Number of (3+1)X(n+1) arrays of permutations of 0..n*k-1 4+3 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.

STATUS

approved

editing

#4 by R. H. Hardin at Tue Nov 03 08:11:52 EST 2015

STATUS

editing

approved

#3 by R. H. Hardin at Tue Nov 03 08:11:49 EST 2015

LINKS

R. H. Hardin, <a href="/A264092/b264092.txt">Table of n, a(n) for n = 1..210</a>

#2 by R. H. Hardin at Tue Nov 03 08:11:31 EST 2015

NAME

allocated for R. H. Hardin

Number of (3+1)X(n+1) arrays of permutations of 0..n*k-1 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.

DATA

16, 169, 2401, 32761, 456976, 6355441, 88529281, 1232922769, 17172529936, 239180661721, 3331358690401, 46399815451081, 646266084871696, 9001325016847969, 125372284530501121, 1746210653453054881

OFFSET

1,1

COMMENTS

Row 3 of A264090.

FORMULA

Empirical: a(n) = 14*a(n-1) +14*a(n-2) -210*a(n-3) +210*a(n-5) -14*a(n-6) -14*a(n-7) +a(n-8)

EXAMPLE

Some solutions for n=4

..0..1..3..4.12....1..0.10..3.12....1..0.10.11..4....1..0..2..4..3

..6..5..8..7..9....5..7..6..8.17....5..6.15..8..9....6..5..7..9..8

..2.10.11.14.13....2.11..4.13.14....2..3.12.13.14...11.10.12.14.13

.16.15.17.19.18...16.15..9.18.19....7.17.16.19.18...16.15.17.18.19

CROSSREFS

Cf. A264090.

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Nov 03 2015

STATUS

approved

editing

#1 by R. H. Hardin at Tue Nov 03 08:01:10 EST 2015

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved