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!)
A251454 Number of (n+1) X (3+1) 0..3 arrays with every 2 X 2 subblock summing to a prime. 1

%I #6 May 24 2024 13:20:24

%S 6398,194586,5783416,172965058,5162094982,154267520858,4606843590302,

%T 137657116629832,4111638505603610,122852558520079282,

%U 3669798382143064858,109646194005440865702,3275476445946738392702,97861845165754237937150

%N Number of (n+1) X (3+1) 0..3 arrays with every 2 X 2 subblock summing to a prime.

%C Column 3 of A251459.

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

%H R. H. Hardin, <a href="/A251454/a251454.txt">Empirical recurrence of order 99</a>

%F Empirical recurrence of order 99 (see link above).

%e Some solutions for n=2

%e ..0..1..1..0....0..0..3..0....0..2..3..0....0..0..1..1....0..3..2..1

%e ..3..1..0..1....1..1..1..1....1..2..0..0....1..1..1..2....2..0..0..2

%e ..0..3..1..1....2..3..2..3....3..1..2..3....1..2..3..1....0..0..2..1

%Y Cf. A251459.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 02 2014

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 July 16 16:05 EDT 2024. Contains 374355 sequences. (Running on oeis4.)