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.

A347626 Number of partitions of n^n into distinct odd parts.

This page as a plain text file.
%I A347626 #24 Sep 09 2021 13:59:44
%S A347626 1,1,1,14,2824974,7375247711025022789604527681
%N A347626 Number of partitions of n^n into distinct odd parts.
%C A347626 The next term a(6) = 1.46058224...*10^116 is too large to include.
%H A347626 Seiichi Manyama, <a href="/A347626/b347626.txt">Table of n, a(n) for n = 0..7</a>
%F A347626 a(n) = [x^(n^n)] Product_{k>=0} (1 + x^(2*k+1)).
%F A347626 a(n) = A000700(n^n).
%o A347626 (PARI) a(n) = polcoef(prod(k=0, n^n\2, 1+x^(2*k+1)+x*O(x^(n^n))), n^n);
%Y A347626 Main diagonal of A347630.
%Y A347626 Cf. A000312, A000700, A064682, A281489.
%K A347626 nonn
%O A347626 0,4
%A A347626 _Seiichi Manyama_, Sep 09 2021