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.

A246483 Number of length 4+3 0..n arrays with no pair in any consecutive four terms totalling exactly n.

This page as a plain text file.
%I A246483 #6 Jul 23 2025 11:31:26
%S A246483 2,28,644,3904,24582,91212,317576,857248,2174090,4780060,10007052,
%T A246483 19154208,35306894,61236364,103134992,166247872,261796626,398879388,
%U A246483 596338580,868942720,1246516502,1751814988,2429877144,3314320224
%N A246483 Number of length 4+3 0..n arrays with no pair in any consecutive four terms totalling exactly n.
%C A246483 Row 4 of A246479
%H A246483 R. H. Hardin, <a href="/A246483/b246483.txt">Table of n, a(n) for n = 1..210</a>
%F A246483 Empirical: a(n) = 3*a(n-1) +2*a(n-2) -14*a(n-3) +5*a(n-4) +25*a(n-5) -20*a(n-6) -20*a(n-7) +25*a(n-8) +5*a(n-9) -14*a(n-10) +2*a(n-11) +3*a(n-12) -a(n-13)
%e A246483 Some solutions for n=6
%e A246483 ..6....0....3....2....0....3....0....3....0....2....5....4....6....2....1....1
%e A246483 ..6....0....6....2....0....2....1....5....2....6....0....4....5....1....6....4
%e A246483 ..4....3....5....5....4....5....4....5....0....2....0....5....6....6....6....0
%e A246483 ..6....2....2....6....1....6....4....5....5....5....4....5....2....3....4....3
%e A246483 ..5....1....3....6....3....2....4....3....5....2....0....0....3....6....4....0
%e A246483 ..5....2....2....3....1....6....0....4....5....6....0....4....5....4....5....0
%e A246483 ..6....2....2....2....4....6....3....4....0....6....3....3....5....6....6....0
%K A246483 nonn
%O A246483 1,1
%A A246483 _R. H. Hardin_, Aug 27 2014