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.

A025422 Number of partitions of n into 7 squares.

This page as a plain text file.
%I A025422 #16 Aug 19 2020 15:44:34
%S A025422 1,1,1,1,2,2,2,2,2,3,3,2,3,4,3,3,4,4,5,4,5,6,6,4,5,7,6,6,7,8,8,7,6,8,
%T A025422 9,7,10,11,10,9,10,10,11,10,10,15,12,10,11,13,14,12,15,16,18,15,13,16,
%U A025422 17,14,16,20,17,18,16,18,21,18,19,23,24,18,21,21,22,22,23,26,25,24,21,27,27,23
%N A025422 Number of partitions of n into 7 squares.
%H A025422 Alois P. Heinz, <a href="/A025422/b025422.txt">Table of n, a(n) for n = 0..10000</a>
%p A025422 b:= proc(n, i, t) option remember; `if`(n=0, 1,
%p A025422       `if`(i<1 or t<1, 0, b(n, i-1, t)+
%p A025422       `if`(i^2>n, 0, b(n-i^2, i, t-1))))
%p A025422     end:
%p A025422 a:= n-> b(n, isqrt(n), 7):
%p A025422 seq(a(n), n=0..120);  # _Alois P. Heinz_, May 30 2014
%t A025422 b[n_, i_, t_] := b[n, i, t] = If[n == 0, 1, If[i<1 || t<1, 0, b[n, i-1, t] + If[i^2 > n, 0, b[n-i^2, i, t-1]]]]; a[n_] := b[n, Sqrt[n] // Floor, 7]; Table[a[n], {n, 0, 120}] (* _Jean-François Alcover_, Jun 11 2015, after _Alois P. Heinz_ *)
%K A025422 nonn
%O A025422 0,5
%A A025422 _David W. Wilson_