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.

A250231 Number of length 4+1 0..n arrays with the sum of the cubes of adjacent differences multiplied by some arrangement of +-1 equal to zero.

This page as a plain text file.
%I A250231 #6 Jul 23 2025 12:15:38
%S A250231 16,79,208,473,872,1519,2392,3617,5184,7239,9648,12697,16176,20367,
%T A250231 25064,30545,36568,43583,51216,59849,69192,79655,90856,103417,116784,
%U A250231 131415,147000,163993,181952,201503,222096,244297,267544,292495,318536,346537
%N A250231 Number of length 4+1 0..n arrays with the sum of the cubes of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250231 Row 4 of A250229
%H A250231 R. H. Hardin, <a href="/A250231/b250231.txt">Table of n, a(n) for n = 1..54</a>
%e A250231 Some solutions for n=6
%e A250231 ..3....6....3....0....4....4....3....6....1....0....2....3....5....0....4....4
%e A250231 ..4....3....5....2....1....2....6....4....0....3....1....5....1....6....5....5
%e A250231 ..2....6....4....3....0....4....5....6....1....6....2....3....5....1....2....4
%e A250231 ..0....2....6....2....3....3....6....3....0....1....0....6....4....6....5....5
%e A250231 ..1....6....5....0....2....2....3....6....1....6....2....3....3....0....6....6
%K A250231 nonn
%O A250231 1,1
%A A250231 _R. H. Hardin_, Nov 14 2014