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.

A262418 Number of (n+1)X(6+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.

This page as a plain text file.
%I A262418 #4 Sep 22 2015 09:30:12
%S A262418 0,2892,124572,7577424,326005344,15231780324,655089996204,
%T A262418 28755516792360,1236553617638640,53446495303862172,
%U A262418 2298231625018170492,98951519822732397504,4254930564828132559104,183021121626516730866324
%N A262418 Number of (n+1)X(6+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C A262418 Column 6 of A262420.
%H A262418 R. H. Hardin, <a href="/A262418/b262418.txt">Table of n, a(n) for n = 1..210</a>
%F A262418 Empirical: a(n) = 43*a(n-1) +777*a(n-2) -33411*a(n-3) -179235*a(n-4) +7707105*a(n-5) +17148167*a(n-6) -737371181*a(n-7) -706190268*a(n-8) +30366181524*a(n-9) +11010302352*a(n-10) -473443001136*a(n-11) -33794555200*a(n-12) +1453165873600*a(n-13)
%e A262418 Some solutions for n=3
%e A262418 ..0..1..1..0..0..1..1....1..1..1..0..0..1..0....0..1..0..1..0..1..0
%e A262418 ..0..1..1..0..1..1..0....0..1..0..1..1..0..1....1..0..1..0..0..0..1
%e A262418 ..1..1..1..1..0..0..0....1..0..1..1..0..1..0....0..1..1..1..0..0..1
%e A262418 ..0..0..0..0..1..1..0....1..1..1..1..0..0..0....0..0..1..0..1..0..1
%Y A262418 Cf. A262420.
%K A262418 nonn
%O A262418 1,2
%A A262418 _R. H. Hardin_, Sep 22 2015