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.

A245955 Number of length 5+3 0..n arrays with some pair in every consecutive four terms totalling exactly n.

This page as a plain text file.
%I A245955 #6 Jul 23 2025 11:30:29
%S A245955 162,4145,26244,128649,381222,1021225,2217096,4555697,8345130,
%T A245955 14757441,24276492,38959225,59493294,89187449,128950032,183778785,
%U A245955 254805426,349227217,468384660,622261481,812372022,1052152905,1343233944
%N A245955 Number of length 5+3 0..n arrays with some pair in every consecutive four terms totalling exactly n.
%C A245955 Row 5 of A245950
%H A245955 R. H. Hardin, <a href="/A245955/b245955.txt">Table of n, a(n) for n = 1..210</a>
%F A245955 Empirical: a(n) = 2*a(n-1) +4*a(n-2) -10*a(n-3) -5*a(n-4) +20*a(n-5) -20*a(n-7) +5*a(n-8) +10*a(n-9) -4*a(n-10) -2*a(n-11) +a(n-12)
%e A245955 Some solutions for n=4
%e A245955 ..2....4....0....1....1....3....1....1....3....3....2....0....0....3....0....4
%e A245955 ..2....0....4....2....1....0....1....3....1....0....1....1....2....0....4....0
%e A245955 ..3....4....0....2....4....3....1....0....2....3....4....2....1....2....2....4
%e A245955 ..2....4....4....2....3....4....3....1....4....1....3....3....3....4....4....1
%e A245955 ..1....0....0....4....1....3....2....3....0....1....1....2....1....4....2....2
%e A245955 ..2....4....3....3....3....1....1....0....3....0....2....4....3....0....2....0
%e A245955 ..3....1....4....1....4....4....2....0....1....4....0....2....1....1....2....4
%e A245955 ..1....3....0....4....4....0....0....1....3....0....2....2....3....2....3....0
%K A245955 nonn
%O A245955 1,1
%A A245955 _R. H. Hardin_, Aug 08 2014