The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263459 Number of (n+1) X (1+1) 0..4 arrays with each row and column divisible by 11, read as a base-5 number with top and left being the most significant digits. 1
 2, 3, 8, 23, 67, 200, 597, 1790, 5369, 16105, 48314, 144939, 434816, 1304447, 3913339, 11740016, 35220045, 105660134, 316980401, 950941201, 2852823602, 8558470803, 25675412408, 77026237223, 231078711667, 693236135000, 2079708404997 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 3*a(n-1) + a(n-5) - 3*a(n-6). Empirical g.f.: x*(2 - 3*x - x^2 - x^3 - 2*x^4 - 3*x^5) / ((1 - x)*(1 - 3*x)*(1 + x + x^2 + x^3 + x^4)). - Colin Barker, Jan 01 2019 EXAMPLE Some solutions for n=4: ..0..0....2..1....0..0....4..2....0..0....4..2....4..2....0..0....0..0....0..0 ..0..0....0..0....0..0....2..1....4..2....2..1....2..1....4..2....2..1....0..0 ..4..2....4..2....0..0....0..0....2..1....4..2....0..0....2..1....4..2....0..0 ..2..1....2..1....4..2....4..2....4..2....2..1....0..0....0..0....0..0....0..0 ..0..0....4..2....2..1....2..1....2..1....0..0....0..0....0..0....2..1....0..0 CROSSREFS Column 1 of A263464. Sequence in context: A006796 A241904 A006076 * A261061 A086628 A032096 Adjacent sequences:  A263456 A263457 A263458 * A263460 A263461 A263462 KEYWORD nonn AUTHOR R. H. Hardin, Oct 19 2015 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.

Last modified October 1 13:04 EDT 2020. Contains 337443 sequences. (Running on oeis4.)