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.

A216631 Number of nondecreasing arrays of n 0..n-1 integers with the sum of their 3rd powers equal to sum(i^3,i=0..n-1).

This page as a plain text file.
%I A216631 #5 Jun 02 2025 08:07:17
%S A216631 1,1,1,1,1,1,3,8,18,42,100,265,775,2241,6709,20661,64264,202154,
%T A216631 647838,2095932,6861091,22703554,75731878,254656486,862839461,
%U A216631 2942117884,10094669306,34837009237,120849420979,421291017964,1475463672293
%N A216631 Number of nondecreasing arrays of n 0..n-1 integers with the sum of their 3rd powers equal to sum(i^3,i=0..n-1).
%C A216631 Column 3 of A216635
%e A216631 All solutions for n=8
%e A216631 ..0....1....2....1....0....0....1....0
%e A216631 ..0....1....3....2....1....0....4....1
%e A216631 ..2....1....4....2....2....0....4....1
%e A216631 ..4....2....4....3....3....1....4....4
%e A216631 ..4....5....4....3....4....2....5....5
%e A216631 ..6....6....5....3....5....6....5....5
%e A216631 ..6....6....6....7....6....6....5....5
%e A216631 ..6....6....6....7....7....7....6....7
%K A216631 nonn
%O A216631 1,7
%A A216631 _R. H. Hardin_ Sep 11 2012