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.

A347607 Number of partitions of n^n.

This page as a plain text file.
%I A347607 #29 Sep 09 2021 18:36:20
%S A347607 1,1,5,3010,365749566870782,
%T A347607 8630901377559029573671524821295260243701883575513498104067
%N A347607 Number of partitions of n^n.
%C A347607 The next term a(6) = 1.30449952...*10^235 is too large to include.
%C A347607 a(7) = 1.5782589391...*10^1004. - _Chai Wah Wu_, Sep 09 2021
%H A347607 Seiichi Manyama, <a href="/A347607/b347607.txt">Table of n, a(n) for n = 0..6</a>
%F A347607 a(n) = A000041(n^n).
%p A347607 a:= n-> combinat[numbpart](n^n):
%p A347607 seq(a(n), n=0..6);  # _Alois P. Heinz_, Sep 09 2021
%o A347607 (PARI) a(n) = numbpart(n^n);
%o A347607 (Python)
%o A347607 from sympy.functions import partition
%o A347607 def A347607(n): return partition(n**n) # _Chai Wah Wu_, Sep 09 2021
%Y A347607 Main diagonal of A347615.
%Y A347607 Cf. A000041, A000312, A064682, A072213, A128854.
%K A347607 nonn
%O A347607 0,3
%A A347607 _Seiichi Manyama_, Sep 08 2021