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.
[NumberOfPartitions(5^n): n in [0..6]]; // Vincenzo Librandi, Oct 13 2014
Table[ PartitionsP[ 5^n], {n, 0, 6}]
vector(8, n, n--; numbpart(5^n)) \\ Michel Marcus, Oct 13 2014
[NumberOfPartitions(6^n): n in [0..6]]; // Vincenzo Librandi, Oct 13 2014
Table[ PartitionsP[ 6^n], {n, 0, 5}]
[Floor(Log(10,(NumberOfPartitions(3^n))))+1: n in [0..12]]; // Vincenzo Librandi, Oct 13 2014
f[n_] := Floor[ Log[10, PartitionsP[ 3^n]] + 1]; Table[ f@n, {n, 0, 30}]
IntegerLength[PartitionsP[3^Range[0,30]]] (* Harvey P. Dale, Sep 05 2023 *)
a(n) = #Str(numbpart(3^n)); \\ Michel Marcus, Oct 13 2014
[NumberOfPartitions(7^n): n in [0..6]]; // Vincenzo Librandi, Oct 13 2014
Table[ PartitionsP[ 7^n], {n, 0, 5}]
a(n) = numbpart(7^n) \\ Michel Marcus, Oct 18 2014
Square array begins: 1, 1, 1, 1, 1, ... 1, 1, 1, 1, 1, ... 1, 2, 5, 22, 231, ... 1, 3, 30, 3010, 18004327, ... 1, 5, 231, 1741630, 365749566870782, ...
T(n, k) = numbpart(n^k);
Table[ PartitionsQ[3^n], {n, 0, 10}]
Comments