login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276430 Triangle read by rows: T(n,k) is the number of partitions of n having k parts that are powers of 2 with positive exponent (n>=0). 2
1, 1, 1, 1, 2, 1, 2, 2, 1, 3, 3, 1, 5, 3, 2, 1, 6, 5, 3, 1, 7, 8, 4, 2, 1, 10, 10, 6, 3, 1, 13, 13, 9, 4, 2, 1, 16, 18, 12, 6, 3, 1, 22, 22, 16, 10, 4, 2, 1, 27, 29, 22, 13, 6, 3, 1, 33, 40, 28, 17, 10, 4, 2, 1, 43, 49, 37, 24, 13, 6, 3, 1, 52, 63, 50, 31, 18, 10, 4, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Sum of entries in row n is A000041(n) (the partition numbers).

T(n,0) = A276431(n).

Sum(k*T(n,k), k>=0) = A073119(n).

LINKS

Alois P. Heinz, Rows n = 0..300, flattened

FORMULA

G.f.:  G(t,x) = Product_{i>=1} (1-x^{h(i)})/((1-x^i)*(1-t*x^{h(i)})), where h(i) = 2^i.

EXAMPLE

T(6,1) = 3, counting [1,1,4], [1,2,3], [1,1,1,1,2];

T(6,2) = 2, counting [2,4], [1,1,2,2];

T(6,3) = 1, counting [2,2,2];

Triangle starts:

1;

1;

1,1;

2,1;

2,2,1;

3,3,1;

...

MAPLE

h := proc (i) options operator, arrow: 2^i end proc: G := product((1-x^h(i))/((1-x^i)*(1-t*x^h(i))), i = 1 .. 30): Gser := simplify(series(G, x = 0, 25)): for n from 0 to 20 do P[n] := sort(coeff(Gser, x, n)) end do: for n from 0 to 20 do seq(coeff(P[n], t, k), k = 0 .. degree(P[n])) end do; # yields sequence in triangular form

# second Maple program:

p2:= proc(n) p2(n):= is(n=2^ilog2(n)) end:

b:= proc(n, i) option remember; expand(`if`(n=0 or i=1, 1,

      b(n, i-1)+`if`(i>n, 0, b(n-i, i)*`if`(p2(i), x, 1))))

    end:

T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n$2)):

seq(T(n), n=0..30);  # Alois P. Heinz, Sep 20 2016

MATHEMATICA

p2[n_] := n == 2^Floor[Log[2, n]]; b[n_, i_] := b[n, i] = Expand[If[n == 0 || i == 1, 1, b[n, i-1] + If[i>n, 0, b[n-i, i]*If[p2[i], x, 1]]]]; T[n_] := Function [p, Table[Coefficient[p, x, i], {i, 0, Exponent[p, x]}]][b[n, n]]; Table[T[n], {n, 0, 30}] // Flatten (* Jean-Fran├žois Alcover, Dec 21 2016, after Alois P. Heinz *)

CROSSREFS

Cf. A000041, A073119, A276431.

Sequence in context: A264404 A116482 A173306 * A325002 A182594 A201593

Adjacent sequences:  A276427 A276428 A276429 * A276431 A276432 A276433

KEYWORD

nonn,tabf

AUTHOR

Emeric Deutsch, Sep 19 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 17 02:22 EST 2020. Contains 331976 sequences. (Running on oeis4.)