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.

A341136 Number of ways to write n as an ordered sum of 7 prime powers (including 1).

This page as a plain text file.
%I A341136 #6 Feb 05 2021 18:54:33
%S A341136 1,7,28,84,210,455,882,1569,2611,4116,6223,9093,12901,17822,24053,
%T A341136 31759,41132,52367,65702,81326,99526,120471,144417,171493,201985,
%U A341136 235963,273889,315805,362181,413021,468888,529466,595770,667541,745899,830473,922866,1021832,1129499
%N A341136 Number of ways to write n as an ordered sum of 7 prime powers (including 1).
%p A341136 q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
%p A341136 b:= proc(n, t) option remember;
%p A341136       `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add(
%p A341136       `if`(q(j), b(n-j, t-1), 0), j=1..n)))
%p A341136     end:
%p A341136 a:= n-> b(n, 7):
%p A341136 seq(a(n), n=7..45);  # _Alois P. Heinz_, Feb 05 2021
%t A341136 nmax = 45; CoefficientList[Series[Sum[Boole[PrimePowerQ[k] || k == 1] x^k, {k, 1, nmax}]^7, {x, 0, nmax}], x] // Drop[#, 7] &
%Y A341136 Cf. A000961, A010055, A282062, A282064, A341125, A341133, A341134, A341135, A341137, A341138, A341139.
%K A341136 nonn
%O A341136 7,2
%A A341136 _Ilya Gutkovskiy_, Feb 05 2021