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.

A201091 Number of -n..n arrays of 6 elements with first and second differences also in -n..n.

This page as a plain text file.
%I A201091 #7 Jul 22 2025 16:05:09
%S A201091 89,1653,11817,52401,172767,468159,1100401,2326467,4525989,8241301,
%T A201091 14210297,23419633,37141027,56999737,85011997,123671261,175984071,
%U A201091 245577021,336727861,454496567,604748137,794311497,1030990023,1323752505
%N A201091 Number of -n..n arrays of 6 elements with first and second differences also in -n..n.
%C A201091 Row 6 of A201088
%H A201091 R. H. Hardin, <a href="/A201091/b201091.txt">Table of n, a(n) for n = 1..210</a>
%F A201091 Empirical: a(n) = 3*a(n-2) +2*a(n-3) -2*a(n-4) -5*a(n-5) -3*a(n-6) +a(n-7) +4*a(n-8) +6*a(n-9) +3*a(n-10) -3*a(n-11) -6*a(n-12) -4*a(n-13) -a(n-14) +3*a(n-15) +5*a(n-16) +2*a(n-17) -2*a(n-18) -3*a(n-19) +a(n-21)
%e A201091 Some solutions for n=4
%e A201091 ..0...-4....1...-1....3....1....0....1....0....1....0...-1...-4....3....1....4
%e A201091 ..3...-2....4....0....2...-1....0....0...-1....3....2....0...-4....1....2....1
%e A201091 ..4....0....4...-1....2...-4...-2....0...-2....2....2....1...-2....0....2....0
%e A201091 ..2....0....2...-2....3...-3...-2....0....1....3...-1....2...-2...-1....3....0
%e A201091 ..1....1....2....0....2...-4...-2....2....1....2...-2....1...-1....1....4...-1
%e A201091 .-3....4....4....1....0...-2....2....0....0....4....0....1....2....3....1...-2
%K A201091 nonn
%O A201091 1,1
%A A201091 _R. H. Hardin_ Nov 26 2011