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.

A347618 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k into n or more parts.

This page as a plain text file.
%I A347618 #14 Sep 09 2021 10:41:23
%S A347618 1,1,1,1,1,0,1,1,1,0,1,1,4,1,0,1,1,21,25,1,0,1,1,230,2996,201,1,0,1,1,
%T A347618 8348,18004286,1741256,1773,1,0,1,1,1741629,133978259344766,
%U A347618 365749566865192,3163112106,16751,1,0,1,1,4351078599,233202632378520643600874780,61847822068260244309086870896081,1606903190858354687391986,15285150382556,165083,1,0
%N A347618 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k into n or more parts.
%F A347618 T(n,k) = [x^(n^k)] Sum_{i>=n} x^i / Product_{j=1..i} (1 - x^j).
%F A347618 T(n,k) = A347615(n,k) + A347617(n,k) - A238016(n,k).
%e A347618 Square array begins:
%e A347618   1, 1,   1,       1,               1, ...
%e A347618   1, 1,   1,       1,               1, ...
%e A347618   0, 1,   4,      21,             230, ...
%e A347618   0, 1,  25,    2996,        18004286, ...
%e A347618   0, 1, 201, 1741256, 365749566865192, ...
%Y A347618 Columns k=0..3 give A019590(n+1), A000012, A347585, A347604.
%Y A347618 Main diagonal gives A347605.
%Y A347618 Cf. A238016, A347615, A347617.
%K A347618 nonn,tabl
%O A347618 0,13
%A A347618 _Seiichi Manyama_, Sep 08 2021