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.

A151762 G.f.: Theta^6, where Theta = Sum_{k>=0} x^(2^k).

This page as a plain text file.
%I A151762 #15 Apr 25 2022 09:12:35
%S A151762 0,0,0,0,0,0,1,6,15,26,45,66,76,96,126,140,165,210,221,210,240,252,
%T A151762 246,300,346,360,366,380,396,420,440,480,525,450,405,450,416,396,510,
%U A151762 540,510,516,582,540,636,660,720,720,706,600,630,620,636,660,800,720,756,660,720
%N A151762 G.f.: Theta^6, where Theta = Sum_{k>=0} x^(2^k).
%C A151762 Number of ways to write n as an ordered sum of 6 powers of 2. - _Ilya Gutkovskiy_, Feb 02 2021
%H A151762 Seiichi Manyama, <a href="/A151762/b151762.txt">Table of n, a(n) for n = 0..10000</a>
%p A151762 b:= proc(n, t) option remember; `if`(n=0, `if`(t=0, 1, 0),
%p A151762       `if`(t<1, 0, add(b(n-2^j, t-1), j=0..ilog2(n))))
%p A151762     end:
%p A151762 a:= n-> b(n, 6):
%p A151762 seq(a(n), n=0..58);  # _Alois P. Heinz_, Feb 02 2021
%t A151762 b[n_, t_] := b[n, t] = If[n == 0, If[t == 0, 1, 0],
%t A151762      If[t < 1, 0, Sum[b[n - 2^j, t - 1], {j, 0, Floor@Log2[n]}]]];
%t A151762 a[n_] := b[n, 6];
%t A151762 Table[a[n], {n, 0, 58}] (* _Jean-François Alcover_, Apr 25 2022, after _Alois P. Heinz_ *)
%Y A151762 (Sum_{k>=0} x^(2^k))^m; A209229 (m=1), A073267 (m=2), A151759 (m=3), A151760 (m=4), A151761 (m=5), this sequence (m=6).
%Y A151762 Cf. A151758.
%K A151762 nonn
%O A151762 0,8
%A A151762 _N. J. A. Sloane_, Jun 22 2009