login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220926 Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 n X 2 array. 1
4, 13, 41, 114, 260, 545, 1104, 2182, 4201, 7862, 14295, 25272, 43500, 73013, 119684, 191880, 301285, 463918, 701375, 1042326, 1524300, 2195793, 3118736, 4371362, 6051513, 8280430, 11207071, 15013004, 19917924, 26185845, 34132020, 44130644 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 2 of A220931.
LINKS
FORMULA
Empirical: a(n) = (1/20160)*n^8 - (1/2520)*n^7 - (1/1440)*n^6 + (7/45)*n^5 - (3953/2880)*n^4 + (2093/360)*n^3 + (1049/560)*n^2 - (12377/420)*n + 28 for n>3.
Conjectures from Colin Barker, Aug 03 2018: (Start)
G.f.: x*(4 - 23*x + 68*x^2 - 123*x^3 + 122*x^4 - x^5 - 153*x^6 + 172*x^7 - 65*x^8- 8*x^9 + 11*x^10 - 2*x^11) / (1 - x)^9.
a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) +36*a(n-7) - 9*a(n-8) + a(n-9) for n>12.
(End)
EXAMPLE
Some solutions for n=3:
..1..1....1..1....0..0....1..1....0..0....0..0....1..1....0..0....1..1....1..1
..1..1....1..1....0..2....1..1....0..1....0..2....1..1....0..1....1..2....1..1
..3..3....1..1....2..3....2..3....1..3....3..3....1..2....1..2....3..3....1..3
CROSSREFS
Cf. A220931.
Sequence in context: A222270 A351892 A213496 * A077284 A070428 A320563
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 25 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)