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.

A183949 Number of strings of numbers x(i=1..n) in 0..5 with sum i^2*x(i) equal to n^2*5.

This page as a plain text file.
%I A183949 #12 Jun 02 2025 03:23:10
%S A183949 1,2,4,14,53,180,656,2195,7250,23044,71123,213368,624425,1784399,
%T A183949 4986210,13657266,36691985,96863639,251472815,642811767,1619203005,
%U A183949 4022796235,9864987052,23894800443,57205375668,135438579331,317296680619
%N A183949 Number of strings of numbers x(i=1..n) in 0..5 with sum i^2*x(i) equal to n^2*5.
%C A183949 Column 5 of A183953
%H A183949 R. H. Hardin, <a href="/A183949/b183949.txt">Table of n, a(n) for n = 1..54</a>
%e A183949 All solutions for n=4
%e A183949 ..0....1....0....3....3....3....4....2....4....1....5....0....3....5
%e A183949 ..3....1....4....0....1....4....3....3....2....5....4....0....5....0
%e A183949 ..4....3....0....5....1....5....0....2....4....3....3....0....1....3
%e A183949 ..2....3....4....2....4....1....4....3....2....2....2....5....3....3
%t A183949 r[n_, k_, s_] := r[n, k, s] = Which[s < 0, 0, n == 0, If[s == 0, 1, 0], True, Sum[r[n - 1, k, s - c*n^2], {c, 0, k}]];
%t A183949 T[n_, k_] := r[n, k, k*n^2];
%t A183949 a[n_] := T[n, 5];
%t A183949 Table[a[n], {n, 1, 40}] (* _Jean-François Alcover_, Jul 22 2022, after _R. J. Mathar_ in A183953 *)
%K A183949 nonn
%O A183949 1,2
%A A183949 _R. H. Hardin_, Jan 08 2011