login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A362425
Number of partitions of n into 3 distinct perfect powers (A001597).
2
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 3, 0, 3, 3, 1, 1, 1, 4, 1, 1, 2, 3, 1, 0, 3, 1, 2, 1, 3, 4, 2, 1, 1, 2, 3, 2, 2, 4, 1, 1, 2, 3, 2, 2, 2, 4, 1, 1, 1, 2, 2, 1, 4, 2, 2, 0, 2, 3, 4, 1
OFFSET
0,22
LINKS
Eric Weisstein's World of Mathematics, Perfect Power.
MATHEMATICA
perfectPowerQ[n_] := n == 1 || GCD @@ FactorInteger[n][[;; , 2]] > 1; a[n_] := Count[IntegerPartitions[n, {3}], _?(AllTrue[#, perfectPowerQ] && UnsameQ @@ # &)]; Array[a, 100, 0] (* Amiram Eldar, May 05 2023 *)
CROSSREFS
Sequence in context: A030216 A357352 A339376 * A159459 A304095 A276675
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Apr 19 2023
STATUS
approved