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.

A184708 Number of strings of numbers x(i=1..8) in 0..n with sum i*x(i) equal to n*8.

This page as a plain text file.
%I A184708 #7 Jun 02 2025 03:51:19
%S A184708 6,58,304,1169,3571,9353,21713,46037,90595,167917,295811,499442,
%T A184708 812681,1281088,1963602,2936595,4295937,6162309,8683612,12041794,
%U A184708 16455557,22188902,29554150,38922422,50726886,65475486,83754336,106242925
%N A184708 Number of strings of numbers x(i=1..8) in 0..n with sum i*x(i) equal to n*8.
%C A184708 Row 8 of A184703
%H A184708 R. H. Hardin, <a href="/A184708/b184708.txt">Table of n, a(n) for n = 1..200</a>
%F A184708 Empirical: a(n)=2*a(n-2)+2*a(n-3)-3*a(n-5)-3*a(n-6)-a(n-7)+2*a(n-8)+2*a(n-9)-a(n-11)+a(n-12)+3*a(n-13)+2*a(n-14)-3*a(n-16)-4*a(n-17)-3*a(n-18)+2*a(n-20)+3*a(n-21)+a(n-22)-a(n-23)+2*a(n-25)+2*a(n-26)-a(n-27)-3*a(n-28)-3*a(n-29)+2*a(n-31)+2*a(n-32)-a(n-34)
%e A184708 Some solutions for n=3
%e A184708 ..2....3....2....1....2....2....0....0....1....0....1....0....1....1....1....2
%e A184708 ..2....0....1....2....1....0....1....3....1....0....3....0....2....2....1....1
%e A184708 ..3....0....1....3....0....2....3....0....0....3....2....2....0....0....3....2
%e A184708 ..1....1....1....1....0....0....0....0....2....0....0....1....0....3....1....0
%e A184708 ..1....1....0....0....1....2....0....1....1....3....1....0....1....0....0....0
%e A184708 ..0....2....1....1....0....1....1....1....0....0....1....0....1....0....0....1
%e A184708 ..0....0....1....0....1....0....1....1....0....0....0....2....0....1....0....0
%e A184708 ..0....0....0....0....1....0....0....0....1....0....0....0....1....0....1....1
%K A184708 nonn
%O A184708 1,1
%A A184708 _R. H. Hardin_ Jan 20 2011