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.

A059587 T(n,m) = (1/m!)*Sum_{i=0..m} stirling1(m,i)*(2^i)*(2^i+1)*...*(2^i+n-1).

This page as a plain text file.
%I A059587 #11 Jul 02 2025 16:02:00
%S A059587 1,1,1,2,1,2,6,7,4,1,6,24,48,68,73,56,28,8,1,24,120,360,940,2251,4704,
%T A059587 8176,11488,12876,11440,8008,4368,1820,560,120,16,1,120,720,3000,
%U A059587 12720,56660,247016,987252,3480536,10647035,28163200,64592320,129068160
%N A059587 T(n,m) = (1/m!)*Sum_{i=0..m} stirling1(m,i)*(2^i)*(2^i+1)*...*(2^i+n-1).
%F A059587 T(n, m) = Sum_{i=0..n} |stirling1(n, i)|*binomial(2^i, m).
%e A059587 Triangle starts:
%e A059587 1, 1;
%e A059587 1, 2, 1;
%e A059587 2, 6, 7, 4, 1;
%e A059587 6, 24, 48, 68, 73, 56, 28, 8, 1;
%e A059587 ...
%p A059587 with(combinat): for n from 0 to 10 do for m from 0 to 2^n do printf(`%d,`,sum(abs(stirling1(n,i))*binomial(2^i, m), i=0..n)) od: od:
%Y A059587 Cf. A059084, (row sums) A059588.
%K A059587 easy,nonn,tabf
%O A059587 0,4
%A A059587 _Vladeta Jovovic_, Jan 23 2001
%E A059587 More terms from _James Sellers_, Jan 24 2001